Derives time-averaged active inference from control principles.
problem Finite-horizon or discounted-surprise problems in active inference.
method Derives infinite-horizon, average-surprise active inference from optimal control principles.
result Unified objective functional for sensorimotor control.
This work frames active inference through control as inference, offering robust control algorithms.
problem Active inference framework lacks practical sensorimotor control algorithms.
method Frame active inference through control as inference, presenting trajectory optimization as inference.
result AI may be framed as partially-observed CaI when the cost function is defined in observation states.
Complexity measures for neural nets with general activations using path-based norms.
problem Control complexity of neural networks with arbitrary activation functions.
method Approximate general activations with ReLU networks and derive path-based norms for complexity control.
result Preliminary analyses of function spaces and regularized estimators.
We show LLMs can be locally linear, enabling better control of activations.
problem Suboptimal control of LLM activations during generation.
method Model LLM inference as a linear dynamical system, compute feedback controllers using Jacobians, and adapt classical control theory.
result Robust, fine-grained control of LLM activations across models and tasks.
Unified Bayesian model explains in-context learning and activation steering in LLMs.
problem Understanding and controlling the behavior of large language models (LLMs) through prompts and activations.
method Developed a Bayesian model to explain and predict the effects of in-context learning and activation steering.
result Unified model predicts distinct phases and sudden shifts in LLM behavior, explaining prior empirical phenomena.
LineFlow is a framework for training RL agents to control production lines.
problem Designing control systems for production lines is challenging.
method Introduces LineFlow, an extensible Python framework for simulating and training RL agents.
result RL agents approach optimal performance in well-understood scenarios but face challenges in complex industrial lines.
A new protocol corrects confounding effects to measure alignment-induced activation shifts accurately.
problem Confounding effects in measuring alignment-induced activation shifts using naive methods.
method Introduces a four-variant decomposition to separate alignment shift from template effects.
result Correctly measures alignment-induced activation shifts, recovering behaviorally active subspace.
Agents learn and control complex mechanical systems through shared memories.
problem Controlling multi-joint dynamical systems.
method Coupled autoregressive active inference agents using Bayesian filtering and minimizing expected free energy.
result Demonstrated learning and control of a double mass-spring-damper system.
New active learning methods for Gaussian process improve predictive modeling of composite fuselage.
problem Improving predictive modeling of composite fuselage with limited training samples and uncertainties.
method Proposed two new active learning algorithms for Gaussian process considering uncertainties.
result The proposed approach realizes better prediction performance for automatic shape control of composite fuselage.
New method for learning indirectly through control variables.
problem Learning relationships when direct manipulation of variables is impossible.
method Study of indirect active learning under nonparametric models with fixed budget.
result Minimax rates for estimating relationships between variables.
This work presents an explicit-implicit procedure to compute a model predictive control (MPC) law with guarantees on recursive feasibility and asymptotic stability. The approach combines an offline-trained fully-connected neural network with an online primal active set solver. The neural network provides a control inpu…
Deep learning models outperform classical methods in forecasting neural activity.
problem Improving forecasting of neural activity using deep learning models.
method Systematic evaluation of eight probabilistic deep learning models against classical statistical models and baseline methods.
result Several deep learning models consistently outperform classical approaches in forecasting neural activity.
Dropout is commonly used to help reduce overfitting in deep neural networks. Sparsity is a potentially important property of neural networks, but is not explicitly controlled by Dropout-based regularization. In this work, we propose Sparseout a simple and efficient variant of Dropout that can be used to control the spa…
Meta-active learning optimizes control of safety-critical systems by efficiently learning dynamics and configurations.
problem Efficiently learning system dynamics and optimal configurations for safety-critical systems like deep brain stimulation.
method Meta-learning an acquisition function using LSTM, cast as meta-learning, with a mixed-integer linear program policy.
result Achieved a 46% increase in information gain and a 20% speedup in computation time over baselines.
We consider active learning with logged data, where labeled examples are drawn conditioned on a predetermined logging policy, and the goal is to learn a classifier on the entire population, not just conditioned on the logging policy. Prior work addresses this problem either when only logged data is available, or purely…
New comparison shows differences in how value is incorporated in AIF and CAI.
problem Clarifying the relationship between Active Inference and Control-as-Inference.
method Formal comparison of AIF and CAI frameworks.
result Primary difference is how value is incorporated into generative models.
Model based predictions of future trajectories of a dynamical system often suffer from inaccuracies, forcing model based control algorithms to re-plan often, thus being computationally expensive, suboptimal and not reliable. In this work, we propose a model agnostic method for estimating the uncertainty of a model?s pr…
A new active learning method for Gaussian process models.
problem Efficiently exploring unbounded state spaces for accurate models.
method Maximizes mutual information with respect to a bounded region using model predictive control.
result Our method yields a better model within the region of interest than entropy-based methods.
We introduce a variational framework to learn the activation functions of deep neural networks. Our aim is to increase the capacity of the network while controlling an upper-bound of the actual Lipschitz constant of the input-output relation. To that end, we first establish a global bound for the Lipschitz constant of …
New method disentangles perceptual uncertainty and behavioral costs in partially observable systems.
problem Tackles inverse optimal control for non-linear partially observable systems.
method Probabilistic approach using maximum causal entropy formulations and local linearization.
result Disentangles perceptual factors and behavioral costs in sequential decision-making.
Automated quality control for seismic data reduces human labor and time.
problem Costly and time-consuming manual QC of seismic data.
method Active learning to select and label relevant seismic data.
result Active learning technique reduces QC time and improves accuracy.
Latent FxLMS accelerates ANC by adapting along low-dimensional filter weights.
problem Improving active noise control with neural adaptive filters.
method Training an auto-encoder on filter coefficients, constraining weights to latent variables, and updating in latent space.
result Latent FxLMS converges in fewer steps with comparable error to standard FxLMS.
Smooth activations enable optimal error rates in neural networks for Sobolev function classes.
problem Achieving optimal approximation and estimation error rates for neural networks in Sobolev function classes.
method Study of neural networks with smooth activations, proving optimal rates via approximation and statistical properties.
result Constant-depth networks with smooth activations achieve optimal rates of approximation and estimation, demonstrating smoothness adaptivity.
User engagement in online social networking depends critically on the level of social activity in the corresponding platform--the number of online actions, such as posts, shares or replies, taken by their users. Can we design data-driven algorithms to increase social activity? At a user level, such algorithms may incre…
As more end devices are getting connected, the Internet will become more congested. Various congestion control techniques have been developed either on transport or network layers. Active Queue Management (AQM) is a paradigm that aims to mitigate the congestion on the network layer through active buffer control to avoi…
Deep residual networks can approximate any continuous function using control theory.
problem Universal approximation capabilities of deep residual neural networks.
method Relating residual networks to control systems and using Lie algebraic techniques.
result Deep residual networks with adequately deep layers can approximate any continuous function on a compact set.
PPAT uses predictions to improve risk estimation in active testing.
problem Exploiting informative predictions from black-box models for efficient risk estimation.
method Combines LURE estimator with prediction-powered control variate.
result PPAT outperforms existing methods in risk estimation and uncertainty quantification.
Paper introduces active and passive causal inference techniques.
problem Causal inference in machine learning.
method Categorizes causal inference techniques into active and passive approaches.
result Describes and discusses various causal inference methods.
New algorithms allow multiple robots to search efficiently without central coordination.
problem Efficiently locating targets in an unknown environment with multiple robots.
method SPATS and LATSI algorithms for asynchronous multi-agent active search.
result Multiple robots can independently make data-collection decisions without a central coordinator.
Active learning method estimates nonlinear systems efficiently.
problem Identifying nonlinear dynamical systems with continuous states and actions.
method Repeating three steps: trajectory planning, tracking, and re-estimation.
result Estimates nonlinear dynamical systems at a parametric rate.
Deep neural networks with piecewise-polynomial activations can approximate smooth functions and their derivatives.
problem Approximating smooth functions and their derivatives with neural networks.
method Derives the depth, width, and sparsity required for approximation in Hölder norms.
result Deep neural networks with bounded weights can approximate Hölder smooth functions and their derivatives.
We investigate sparse representations for control in reinforcement learning. While these representations are widely used in computer vision, their prevalence in reinforcement learning is limited to sparse coding where extracting representations for new data can be computationally intensive. Here, we begin by demonstrat…
Develops wavelet-based neural network approximation theory.
problem Analyzing neural network approximation capabilities over various activation functions.
method Wavelet frame theory on spaces of homogeneous type, sufficient conditions for approximation, error estimates.
result Derives sufficient conditions for neural networks to approximate any functions in a given space, including non-smooth activations.
Extends risk control to adaptive data collection, anytime-valid guarantees.
problem Ensuring safety of machine learning models with critical risk measures.
method Sequential risk controlling prediction sets (RCPS) for adaptive data collection and active labeling.
result Anytime-valid guarantees for risk control in sequential data collection.
This work designs an active world model learning system with progress-based curiosity.
problem Learning compact world models from visual exploration.
method Constructs a curious agent in a 3D environment, using γ-Progress as a curiosity signal. result The γ-Progress-driven controller outperforms state-of-the-art exploration strategies. Controller-Augmented Hidden Markov Models (CHMMs) are a framework for constrained sequential inference.
problem Hidden Markov models fail under pathwise constraints like precedence, visitation, or monotonic state progression.
method CHMMs compile constraints into finite-state controllers, then use standard forward-backward and Viterbi recursions to compute exact constrained posteriors and paths.
result CHMMs provide exact constrained inference, monotone ascent in constrained EM, and linear complexity in controller cardinality.
Painless Activation Steering automates post-training for LMs without manual intervention.
problem Manual post-training methods are time-consuming and labor-intensive.
method Painless Activation Steering (PAS) is a fully automated approach that requires no manual intervention.
result PAS reliably improves performance for behavior tasks but not for intelligence-oriented tasks.
MAPS and MAPS-SE learn from multiple suboptimal experts to improve policies efficiently.
problem Learning from multiple suboptimal experts in reinforcement learning.
method Active policy improvement from multiple black-box oracles.
result MAPS and MAPS-SE achieve sample efficiency and state-wise imitation learning.
Brain-computer interfaces (BCIs) have enabled prosthetic device control by decoding motor movements from neural activities. Neural signals recorded from cortex exhibit nonstationary property due to abrupt noises and neuroplastic changes in brain activities during motor control. Current state-of-the-art neural signal de…
Decodes neural activity to detect context effects in natural settings.
problem Detecting context-dependent changes in neural encoding.
method Decoding-based approach controlling for confounding factors.
result Demonstrates context-dependent changes in neural encoding.
Improved neural ODEs learn adaptable flows.
problem Neural ODEs struggle with expressive power and adaptability.
method Introduce N-CODE modules with dynamic parameters controlled by a trainable map.
result N-CODE modules enhance expressivity of neural ODEs.
New method allows sheets to morph into multiple shapes via spatially varying stimuli.
problem Limitation of current shape-programmed sheets to achieve only one target geometry.
method Patterning the stimulus itself for spatiotemporal control over local deformation magnitudes.
result A single physical sample can be induced to traverse a continuous family of target geometries.
A survey of existing methods for stopping active learning (AL) reveals the needs for methods that are: more widely applicable; more aggressive in saving annotations; and more stable across changing datasets. A new method for stopping AL based on stabilizing predictions is presented that addresses these needs. Furthermo…
Research uses deep learning and copulas to predict multivariate survival data.
problem Handling right-censored and correlated multivariate survival data.
method Integrates deep learning, copula functions, and survival analysis. Uses copula-based activation functions to model nonlinear dependencies.
result Enhanced prediction accuracy for multivariate survival responses.
Agent uses message passing to optimize robot navigation, balancing exploration and exploitation.
problem Optimizing robot navigation in continuous-valued spaces with uncertainty.
method Autoregressive active inference agent using message passing on a factor graph.
result Agent modulates action based on predictive uncertainty, leading to better model of dynamics.
KANHedge improves hedging of high-dimensional options using learnable B-spline activation functions.
problem Challenges in high-dimensional option pricing and hedging due to the curse of dimensionality.
method Introduces KANHedge, a novel BSDE-based hedger leveraging Kolmogorov-Arnold Networks with learnable B-spline activation functions.
result KANHedge provides improved hedging performance, achieving significant reductions in hedging cost metrics.
New algorithm improves graph-based active learning by identifying unexplored regions.
problem Improving graph-based active learning by identifying unexplored regions.
method Poisson Reweighted Laplacian Uncertainty Sampling (PWLL) with a diagonal perturbation.
result PWLL effectively identifies unexplored regions in graph-based data.
Incremental methods for structure learning of pairwise Markov random fields (MRFs), such as grafting, improve scalability by avoiding inference over the entire feature space in each optimization step. Instead, inference is performed over an incrementally grown active set of features. In this paper, we address key compu…