Autonomous vehicles operate in dynamic, ever-changing environments where new scenarios and edge cases constantly emerge. As a result, static learning models are inadequate for ensuring safe and reliable operation. Continuous learning is essential for adapting to these evolving conditions and maintaining robust performance across diverse real-world settings. However, autonomous vehicles generate massive streams of visual data during operation, and existing continuous learning approaches typically rely on heuristic sampling methods that fail to capture temporal dynamics, often overlooking critical learning opportunities or selecting redundant frames. In this paper, we introduce FrameScope, a temporal data valuation framework for continuous learning in autonomous vehicles. FrameScope extends neural tangent kernel theory to temporal domains, enabling principled valuation of streaming visual data. Unlike cloud-centric methods that transmit all video data for processing, our approach performs principled, local frame selection on the vehicle and queries a cloud-based oracle model only for labels of those high-value frames. Extensive experiments across multiple domain shifts show that FrameScope consistently outperforms existing methods, achieving higher sample efficiency and significantly reducing catastrophic forgetting in autonomous vehicle perception. By valuing data on the vehicle and querying only labels for selected frames, FrameScope reduces bandwidth requirements, enabling scalable operation with a lightweight cloud labeling service.
Yu-Heng Zhu, M. Yoon· IFIP International Informati...· 0 citations
This work forms LLM-driven equation discovery as an iterative search process that unifies Best-of-N, sequential refinement, tree search, and evolution-style methods under a common compute-allocation view and finds that search width is the dominant allocation parameter.
Hao-Wei Lin, Hubert Lim, Xiang-Yu Wang et al.· 0 citations
It is shown that user-preferring conflict resolution can coexist with a readable internal arbitration signal, and successful intervention depends on the geometry of the readout rather than probe accuracy alone, while directions selected mainly for pooled separability steer poorly.
Enrique Balp-Straffon, Chih-Hao Hsu, Rushiraj Gadhvi et al.· 0 citations
MAGG is proposed, a principled multi-agent framework for constructing Governed Knowledge Graphs that introduces explicit governance decisions for reliable and trustworthy knowledge sharing and demonstrates its effectiveness.
Pranav Bykampadi, Neel Mokaria, Vishesh Narayan et al.· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
A three-role Monte Carlo Tree Search (MCTS) framework that treats the Lean 4 compiler purely as a reward oracle using compiler output as a scalar signal for UCB-guided tree updates without feeding error content into the generation context is proposed.
AutoScientist-Quant, a self evolving search process that regards quantitative research as one budgeted search problem, is presented, a self evolving search process that regards quantitative research as one budgeted search problem.
Zong-Qian Li, Yaoyiran Li, Yao-Hui Guo et al.· 0 citations
The proposed learning-assisted Tabu Search notably reduces computation time while consistently producing higher-quality solutions than the standard algorithm, highlighting the potential of combining machine learning with metaheuristics by leveraging the implicit knowledge embedded in search trajectories.
Wissem Ahmed Zaid, Alain Hertz, Denny Liu· 0 citations
A novel preference elicitation algorithm for linear utilities that outperforms prior techniques in practice and is applied to heart transplant allocation where a policy must balance competing objectives such as post-transplant outcomes, waitlist mortality, geographic ease, and equity.
Itai Zilberstein, I. Anagnostides, Zachary W. Sollie et al.· 0 citations
This work introduces a conservative, fully auditable spell-correction reliability layer conceived as a safety-oriented preprocessing module rather than a maximal-accuracy corrector: under conditions of uncertainty, the system abstains from editing, in accordance with a medical do-no-harm philosophy.
Moustafa Mohamed Hassan, Sharon Wong, Woh Kai Xuan· International Conference on...· 0 citations
This work proposes a secure multi-party computation framework that enables the training and inference of CellCnn entirely on secret-shared data, and preserves accuracy close to its plaintext counterpart while outperforming the prior privacy-preserving baseline.
S. S. Magara, Esther Havemann, Debora Jutz et al.· 0 citations
This work introduces \emph{ECHO-OFTRL}: optimistic follow-the-regularized-leader (OFTRL) equipped with an EMA cascade for high-order optimism (ECHO), where EMA denotes exponential moving average, and leverages a new form of optimism inspired by modern filter design.
Mingyang Liu, Gabriele Farina, A. Ozdaglar· 3 citations· ⚡2
The result shows that even a fixed-dimensional latent space suffices to achieve vanishing approximation error as the network budget increases, and it is proved that the optimal worst-case uniform approximation error over the unit ball ofolder functions on $[0,1]^d$ has the sharp order.
A weeklong summer workshop brought higher education faculty to campus to explore how AI and machine learning materials can be adapted for their classrooms.
Adaptive AI agents can help make BIM data more machine-readable by navigating IFC models, interpreting inconsistent information, and mapping it to defined standards. In this blog, Alok Rawat shares findings from a real-world pilot in construction workflows. The post Adaptive AI Agents in Construction Workflows appeared first on GPT-Lab.
