OCULAR calibrates dynamics uncertainty using perception from similar environments to give guaranteed prediction regions for unseen test conditions.
Canonical reference
Title resolution pending
Canonical reference. 83% of citing Pith papers cite this work as background.
citation-role summary
citation-polarity summary
verdicts
UNVERDICTED 10representative citing papers
A new stochastic differential dynamic programming method optimizes coupled trajectory design and orbit determination under partial observability, producing navigation-aware solutions with lower fuel consumption than deterministic local optimization in examples like the circular restricted three-body
Proposes adaptive multiple importance sampling for robust Bayesian model evidence estimation under parameter non-identifiability, shown to outperform deterministic methods on ecological case studies while being cheaper than MCMC.
Augmented Krylov subspaces jointly approximate quadratic forms and log-dets for faster MLE-based hyperparameter tuning in kernel-based linear system identification.
Gaussian mixture models combined with multiple local linearizations solve nonlinear stochastic density steering and yield provably tighter approximation bounds than single-linearization baselines.
A state-space definition of fading memory is introduced that extends incremental input-to-output stability via a memory kernel, is implied by incremental input-to-state stability under bounded inputs, and holds for current-driven memristor models.
Reinforcement learning learns a policy that adapts control parameters of a regularized interior-point method, accelerating high-accuracy solutions for convex quadratic programs and generalizing across problem classes after lightweight training.
A neural network fuses wheel and motor speed signals to cut wheel-speed estimation error by up to 85% versus the production sensor on real Volkswagen ID.7 data.
A survey that taxonomizes threats to agentic AI, reviews benchmarks and evaluation methods, discusses technical and governance defenses, and identifies open challenges.
A systematic mapping study of Karma mechanisms that compares applications, structures design parameters, and maps future research directions in non-monetary resource allocation.
citing papers explorer
-
Local Conformal Calibration of Dynamics Uncertainty from Semantic Images
OCULAR calibrates dynamics uncertainty using perception from similar environments to give guaranteed prediction regions for unseen test conditions.
-
Stochastic Differential Dynamic Programming for Trajectory Optimization under Partial Observability
A new stochastic differential dynamic programming method optimizes coupled trajectory design and orbit determination under partial observability, producing navigation-aware solutions with lower fuel consumption than deterministic local optimization in examples like the circular restricted three-body
-
Reliable model selection in the presence of parameter non-identifiability
Proposes adaptive multiple importance sampling for robust Bayesian model evidence estimation under parameter non-identifiability, shown to outperform deterministic methods on ecological case studies while being cheaper than MCMC.
-
Kernel-based linear system identification using augmented Krylov subspaces
Augmented Krylov subspaces jointly approximate quadratic forms and log-dets for faster MLE-based hyperparameter tuning in kernel-based linear system identification.
-
Nonlinear Stochastic Density Steering via Gaussian Mixture Schrodinger Bridges and Multiple Linearizations
Gaussian mixture models combined with multiple local linearizations solve nonlinear stochastic density steering and yield provably tighter approximation bounds than single-linearization baselines.
-
State-space fading memory
A state-space definition of fading memory is introduced that extends incremental input-to-output stability via a memory kernel, is implied by incremental input-to-state stability under bounded inputs, and holds for current-driven memristor models.
-
Reinforcement learning for adaptive interior point methods in convex quadratic programming
Reinforcement learning learns a policy that adapts control parameters of a regularized interior-point method, accelerating high-accuracy solutions for convex quadratic programs and generalizing across problem classes after lightweight training.
-
Neural Network-Based Virtual Wheel-Speed Sensor for Enhanced Low-Velocity State Estimation
A neural network fuses wheel and motor speed signals to cut wheel-speed estimation error by up to 85% versus the production sensor on real Volkswagen ID.7 data.
-
Agentic AI Security: Threats, Defenses, Evaluation, and Open Challenges
A survey that taxonomizes threats to agentic AI, reviews benchmarks and evaluation methods, discusses technical and governance defenses, and identifies open challenges.
-
Resource Allocation with Karma Mechanisms
A systematic mapping study of Karma mechanisms that compares applications, structures design parameters, and maps future research directions in non-monetary resource allocation.