Adaptive decision-making for state estimation with partial observations.
problem Stochastic state estimation with partial observations and active diagnosis.
method Weak adaptive submodularity and adaptive greedy policy.
result Adaptive greedy policy achieves near-optimal performance for weakly adaptive submodular reward functions.
Selective state-adaptive regularization improves offline RL performance.
problem Extrapolation errors and value overestimation in static dataset RL.
method State-adaptive regularization coefficients trust Bellman-driven results selectively.
result Significant improvement in performance on D4RL benchmark.
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.
Efficient algorithm for reinforcement learning in large state-action spaces with adaptive discretization.
problem Efficient reinforcement learning in large, potentially continuous state-action spaces.
method Adaptive Q-learning policy with data-driven adaptive discretization. result Demonstrates improved performance compared to existing methods, especially in adapting to the problem's structure.
A probabilistic framework for online test-time adaptation
problem Adapting models to new data under distributional shift
method State-space modelling architecture
result Characterizing parameter learning, time evolution, prior tuning, and prediction
Quantum reinforcement learning protocol improves state adaptation efficiency.
problem Efficiently adapting quantum states to unknown reference states in dynamic environments.
method Measurement-based adaptation protocol with quantum reinforcement learning.
result Average fidelity of more than 90% achieved with less than 30 iterations.
New RL algorithm learns state aggregation architecture adaptively.
problem Adapting reinforcement learning value function architectures.
method Adapts state aggregation architecture using state visit frequency feedback.
result Improves RL performance on various test problems.
An adaptive filter improves state estimation for complex systems.
problem Estimating non-Gaussian, multimodal PDFs in nonlinear systems.
method Adaptive split-combine Gaussian mixture filter (AMF) that splits and combines Gaussian particles adaptively.
result AMF consistently outperforms other filters across diverse benchmarks.
We consider 1-qubit mixed quantum state estimation by adaptively updating measurements according to previously obtained outcomes and measurement settings. Updates are determined by the average-variance-optimality (A-optimality) criterion, known in the classical theory of experimental design and applied here to quantum …
Adapts reinforcement learning architectures using state visit frequency.
problem Determining an optimal approximation architecture for reinforcement learning.
method Adapts state aggregation approximation architecture based on state visit frequency.
result Guarantees VF estimate arbitrarily close to zero with large S. Adaptive discretization improves model-based RL in large spaces.
problem Efficient model-based reinforcement learning in large state-action spaces.
method Optimistic one-step value iteration with adaptive discretization.
result Adaptive discretization leads to better performance and lower memory usage.
New algorithm for ML models in gradually adapting data settings.
problem Training models when data distribution reacts to the model over time.
method Stateful Performative Gradient Descent (Stateful PerfGD)
result Stateful PerfGD minimizes performative loss in gradually adapting data settings.
Study shows how adaptive traders decide between fragmented or consolidated markets based on venue demand.
problem Understanding market fragmentation and consolidation in adaptive trading systems.
method Analysis of adaptive traders choosing trading venues based on past experience, considering aggregate parameters like demand to supply ratio.
result Conditions for market fragmentation and stability of steady states are identified, showing fragmented states are metastable.
New method reduces memory usage for adaptive optimization.
problem Significant memory overhead in adaptive optimizers like Adagrad and Adam.
method Memory-efficient adaptive optimization method that retains per-parameter adaptivity.
result Significantly larger models and batch sizes possible with up to 2-fold speedups.
The abstract explores a new wave equation linking quantum mechanics and complex adaptive systems.
problem Understanding the underlying mechanism of distribution formation in complex quantum entanglement.
method Exploring the logical relationship between Schrödinger's wave equation and Shi's trading volume-price wave equation in finance.
result A non-localized wave equation in quantum mechanics reveals the invariance of interaction as a universal law.
Algorithm learns diffusion processes with high-dimensional state spaces.
problem Stochastic control of unbounded diffusion processes with high-dimensional state spaces.
method Adaptive partitioning and learning algorithm that refines discretization based on estimation bias and statistical confidence.
result Established regret bounds that depend on problem parameters, extending to unbounded diffusion processes.
New solver avoids memory issues for long differential equations.
problem Memory constraints in adaptive probabilistic ODE solvers.
method Fixed memory demands adaptive probabilistic solver using robust state estimation.
result Eliminates memory issues for long time series simulations.
SPAQL improves RL by adaptively partitioning state-action space and learning a time-invariant policy.
problem Efficient model-free reinforcement learning with scalable algorithms.
method Adaptive Q-learning with UCB and Boltzmann exploration, automatically tuning temperature.
result SPAQL converges faster and uses fewer resources than AQL, showing higher sample efficiency.
Seq2seq ASR adapts to speakers, improving performance by 25%.
problem Speaker adaptation for seq2seq ASR systems to match conventional methods.
method Applied Kullback-Leibler divergence and Linear Hidden Network adaptation to seq2seq models.
result 25% relative word error rate improvement with seq2seq model adaptation.
A new filter estimates complex system states more accurately.
problem Non-Gaussian features in nonlinear systems violate Kalman-type filters.
method Adaptive split-combine Gaussian mixture filter (AMF) that splits and combines Gaussian particles.
result AMF consistently outperforms other filters across diverse benchmarks.
This paper tackles hidden state inference for HMMs using particle filtering.
problem Inference for hidden states under HMMs is challenging due to unavailable true labels.
method Adaptive conformal inference framework using particle filtering.
result The framework produces prediction sets with specific aggregated coverage levels.
State-space models win a forecasting competition for unstable data.
problem Forecasting electricity demand during the post-covid period.
method Adapting state-space models to balance time-series adaptability and machine learning complexity.
result State-space models provide a better compromise between adaptability and accuracy for non-stationary data.
AMORE uses neural operators to efficiently predict multiple thermochemical states in stiff chemical kinetics.
problem Efficiently integrating stiff chemical kinetics systems to reduce computational cost.
method Developed AMORE, a framework of adaptive multi-output operator network with two adaptive loss functions.
result Demonstrated improved accuracy and efficiency in predicting thermochemical states from initial conditions.
Deep RL learns driving decisions from compact scene descriptions.
problem Learning consistent driving behavior from varying environments.
method Compact semantic state representation for reinforcement learning.
result Agent adapts behavior online without re-training.
Improved model robustness against corruptions using online adaptation.
problem Machine vision models' vulnerability to image corruptions like blurring or compression artefacts.
method Using corrupted images' statistics for unsupervised online adaptation to improve robustness.
result ResNet-50 achieves 62.2% mCE on ImageNet-C with adaptation, improving from 76.7% without.
New method uses fewer parameters to match state-of-the-art performance on multiple natural language tasks.
problem Efficiently adapting BERT for multiple tasks with fewer parameters.
method PALs (projected attention layers) for shared BERT model with task-specific parameters.
result Matches state-of-the-art performance on GLUE benchmark with 7 times fewer parameters.
Adaptive Bayesian method improves deep learning performance and robustness.
problem Ensuring sparsity in deep learning models to improve performance and robustness.
method Adaptive empirical Bayesian method with self-adaptive spike-and-slab priors and stochastic gradient MCMC optimization.
result The method achieves state-of-the-art performance on MNIST and Fashion MNIST and compression performance on CIFAR10.
Adaptive Heston model calibration using PCRLB and switching filters.
problem Estimating volatility in stochastic volatility models like Heston.
method Bayesian filtering (EKF, UKF, PF) with PCRLB for parameter estimation.
result Adaptive estimation of Heston model parameters improves volatility estimation.
Simple randomized EM method outperforms state-of-the-art DA methods.
problem Classifying unlabeled target data using labeled source data from a related domain.
method Randomized Expectation Maximization (EM) method applied to logistic regression and support vector machine.
result Achieves state-of-the-art results on 36 real-life adaptation tasks.
Max-plus algebra approximates MDP value iteration for reduced state space.
problem Approximating optimal value function in high-dimensional MDPs.
method Uses max-plus algebra to represent value functions in a smaller dictionary, leading to an adaptive matching pursuit algorithm.
result Theoretical results show reduced complexity not tied to state space size, with empirical success on simple problems.
STAD adapts models to evolving time-based data shifts.
problem Gradual distribution shifts over time challenge existing test-time adaptation methods.
method Bayesian filtering method that learns time-varying dynamics in hidden features.
result STAD excels in handling small batch sizes and label shift on real-world data.
Graph-Relational Domain Adaptation (GRDA) adapts domains based on their graph structure.
problem Uniform alignment of domains ignores topological structures.
method Uses a domain graph to encode adjacency and a novel graph discriminator.
result Empirically shows improved generalization and domain information incorporation.
Online learners track optimal solutions with constant step-size.
problem Tracking optimal solutions in online learning settings.
method Established a link between steady-state performance and tracking performance using analogies with adaptive filters.
result Inferred tracking performance from steady-state expressions directly.
A new framework for adaptive behavior using reusable value profiles.
problem Adaptive behavior in changing environments requires switching among value-control regimes, but maintaining separate parameters for each situation is impractical.
method Introduces value profiles: reusable bundles of parameters assigned to hidden states, allowing for state-conditional strategy recruitment without independent parameters for each context.
result Profile-based models outperform simpler alternatives in probabilistic reversal learning, suggesting belief-dependent control of adaptive behavior.
Adaptive traffic control uses deep RL to improve decision-making.
problem Improving traffic control using deep RL.
method Integrates recent deep RL techniques into a novel DQN-based algorithm (TC-DQN+) for traffic control.
result Proposes a new reward function for traffic control.
Reward-poisoning attacks can force RL agents to learn bad policies, and we categorize and quantify their feasibility.
problem Reward-poisoning attacks can manipulate RL agents to learn undesirable policies.
method Categorize attacks by infinity-norm constraint, provide thresholds for feasibility, and develop adaptive attack strategies.
result Adaptive reward-poisoning attacks can achieve the nefarious policy in polynomial steps, while non-adaptive attacks require exponential steps.
Framework expands particle filtering to estimate states beyond prior boundaries.
problem Limitations of traditional particle filtering in estimating states outside prior support.
method Diffusion-Enhanced Particle Filtering Framework with adaptive diffusion, entropy-driven regularisation, and kernel-based perturbations.
result Framework significantly improves state estimation accuracy and success rates for out-of-boundary targets.
Graph Kalman filters adapt classical filters to graph data.
problem Adapting classical Kalman filters to graph data.
method Generalizes Kalman filters to attributed graphs, learning state-transition and readout functions end-to-end.
result Adapted Kalman filters can predict graph outputs.
evo-RL combines evolutionary computation with reinforcement learning for better adaptability.
problem Improving reinforcement learning algorithms' adaptability and performance in environments with rewardless states.
method Embedding reinforcement learning in an evolutionary cycle, distinguishing instinctive from learnable behavior.
result evo-RL leads to state-of-the-art performance on OpenAI Gym control problems with rewardless states.
Flora uses random projections to achieve high-rank updates with low memory usage.
problem Excessive memory usage in large neural networks during training.
method Flora approximates LoRA using random projections to enable high-rank updates with sublinear space complexity.
result Flora achieves high-rank updates with significantly reduced memory usage compared to LoRA.
Kernel matrices (e.g. Gram or similarity matrices) are essential for many state-of-the-art approaches to classification, clustering, and dimensionality reduction. For large datasets, the cost of forming and factoring such kernel matrices becomes intractable. To address this challenge, we introduce a new adaptive sampli…
BAM integrates new data while selectively remembering past observations.
problem Slow adaptation and convergence to incorrect parameter values in non-stationary environments.
method Bayes' theorem with adaptive memory selection.
result BAM generalizes and demonstrates continuous adaptation in changing environments.
CARL safely adapts RL agents for safety-critical tasks.
problem Safety hazards in RL for safety-critical tasks.
method CARL combines model-based RL and cautious adaptation.
result CARL achieves higher rewards with fewer failures in safety-critical tasks.
We discuss the stationary states of a model economy in which N heterogeneous adaptive consumers purchase commodity bundles repeatedly from P sellers. The system undergoes a transition from an inefficient to an efficient state as the number of consumers increases. In the latter phase, however, price fluctuations may…
Algorithm detects concept drift and adapts models in streaming data.
problem Concept drift in streaming data renders models inaccurate.
method Adaptive learning algorithm that detects drifts and reacts to them.
result Risk competitive to an algorithm with perfect drift knowledge.
We use statistical learning methods to construct an adaptive state estimator for nonlinear stochastic systems. Optimal state estimation, in the form of a Kalman filter, requires knowledge of the system's process and measurement uncertainty. We propose that these uncertainties can be estimated from (conditioned on) past…
Adaptive TD learning reduces bias in policy evaluation by switching between TD and MC methods.
problem Achieving accurate policy evaluation with Temporal Difference (TD) learning in the presence of state-specific uncertainty.
method Adaptive switching between TD and Monte Carlo (MC) methods, using learned confidence intervals to detect and mitigate bias.
result The proposed adaptive algorithm outperforms existing methods in policy evaluation tasks.
New bounds for adaptive control in high dimensions without fixed state space.
problem Adaptive control of linear systems in high or infinite dimensions.
method Novel perturbation bound for certainty equivalence, scaling with prediction error.
result First regret bounds for LQR in infinite dimensional systems, independent of ambient dimension.