Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

4268521,2771,703 · Jun 202019922001200920172026
48 results for adaptive learning systems

AdaptOn achieves logarithmic regret in adaptive control of unknown partially observable linear systems.

problem Adaptive control in partially observable linear dynamical systems.
method AdaptOn algorithm that estimates system dynamics through online learning and gradient descent.
result AdaptOn achieves a logarithmic regret bound of polylog(T) after T steps.

Adaptive financial dataflow system improves model robustness in dynamic markets.

problem Static historical data leads to poor performance in dynamic financial markets.
method Drift-aware dataflow system with adaptive control and optimization.
result Enhanced model robustness and improved risk-adjusted returns.

Paper proposes adaptive control for unknown systems using reinforcement learning.

problem Adaptive control for unknown, linearizable systems.
method On-policy reinforcement learning for discrete-time, stochastic systems.
result Stability and tracking errors concentrate near zero with high probability.

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.

CoDA adapts dynamics models to new physical systems by conditioning on context.

problem Generalizing to new physical systems with shared dynamics but different contexts.
method Context-informed dynamics adaptation (CoDA) using multiple environments and a hypernetwork.
result State-of-the-art generalization results on nonlinear dynamics.

This paper tackles adaptive control of unknown Markov jump systems with sample complexity and regret bounds.

problem Adaptive control of unknown Markov jump systems with changing dynamics.
method Identification-based adaptive control using a system identification algorithm and certainty equivalent control.
result The proposed adaptive control scheme achieves O(T)\mathcal{O}(\sqrt{T}) regret, improving to O(polylog(T))\mathcal{O}(polylog(T)) with partial knowledge.

Deep reinforcement learning finds optimal learning policies for adaptive systems.

problem Finding individualized learning plans for learners with unknown latent traits.
method Formulated as a Markov decision process, applied deep Q-learning with a transition model estimator.
result The algorithm efficiently discovers optimal learning policies with small data sets.

LqgOpt learns optimal control in unknown LQG systems with minimal regret.

problem Adaptive control in partially observable linear quadratic Gaussian systems with unknown dynamics.
method Optimism in the face of uncertainty, predictor state evolution, closed-loop system identification, confidence bounds.
result Proves a regret upper bound of ildeO(T) ilde{\mathcal{O}}(\sqrt{T}) for LQG systems.

The study sets limits on how well systems can be controlled adaptively.

problem Learning to control unknown linear Gaussian systems with quadratic costs.
method Combining ideas from experiment design, estimation theory, and perturbation bounds of information matrices.
result Regret lower bounds of the order of T\sqrt{T} in the time horizon TT accurately capture control-theoretic parameters.

Adaptive ML learns complex time-varying systems without new data.

problem Applying ML to time-varying systems with shifting distributions.
method Mapping high-dimensional inputs to low-dimensional latent space, actively tuning latent space based on feedback.
result Learning correlations and tracking system evolution in real-time without new data.

Sparse Meta Networks adapt deep neural networks incrementally for fast learning.

problem Training deep neural networks is slow and impractical for complex, changing environments.
method Sparse Meta Networks use a memory layer to learn online sequential adaptation, accumulating fast-weights incrementally.
result Sparse Meta Networks achieve strong performance in various sequential adaptation scenarios.

Adaptive Stress Testing detects financial fraud by simulating potential failures.

problem Detecting and mitigating vulnerabilities in financial systems.
method Developed a simplified model using historical data and reinforcement learning.
result Identified the most likely path to system failure and improved fraud detection.

Consider an assistive system that guides visually impaired users through speech and haptic feedback to their destination. Existing robotic and ubiquitous navigation technologies (e.g., portable, ground, or wearable systems) often operate in a generic, user-agnostic manner. However, to minimize confusion and navigation …

2018-04-11abs ↗pdf ↗

FNSDA adapts to new dynamics via Fourier space adaptation.

problem Generalizing to unseen dynamical systems with limited data.
method Automatic partitioning of known environments in Fourier modes and adaptation of specific modes for new environments.
result FNSDA achieves superior or competitive generalization performance with reduced parameter cost.

Study optimizes health incentives to balance efficiency and fairness.

problem Designing health incentives to balance efficiency and fairness.
method Inverse behavioral optimization framework integrating QALY-based incentives and adaptive learning.
result Modern health systems operate near an efficiency-saturated frontier, with small fairness adjustments yielding diminishing returns.

This paper improves MARL for networked systems through new protocols and discount factors.

problem Improving control in networked systems using multi-agent reinforcement learning.
method Formulated as a spatiotemporal Markov decision process, introduced a spatial discount factor, and proposed NeurComm.
result Appropriate spatial discount factor enhances learning curves of non-communicative MARL algorithms.

Work maximization guides machine learning models in adaptive systems.

problem How machine learning models can be optimized for thermodynamic efficiency.
method Introducing thermodynamic principle to compare with maximum-likelihood principle.
result Maximum-work models are equivalent to maximum-likelihood models in adaptive systems.

Paper presents a method for efficient robot adaptation using fine-tuning.

problem Continuous adaptation of robot learning systems in real-world scenarios.
method Fine-tuning previously learned policies using off-policy reinforcement learning.
result Fine-tuning leads to substantial performance gains and adaptation to new conditions.

We present an approach to adaptively utilize deep neural networks in order to reduce the evaluation time on new examples without loss of accuracy. Rather than attempting to redesign or approximate existing networks, we propose two schemes that adaptively utilize networks. We first pose an adaptive network evaluation sc…

2017-02-25abs ↗pdf ↗

Bayesian approach improves speech recognition with limited speaker data.

problem Reduces mismatch between training and evaluation data due to speaker differences.
method Bayesian learning for DNN adaptation models with limited speaker data.
result Bayesian adaptation consistently outperforms deterministic methods, reducing word error rates up to 1.4%.

This paper describes a reference architecture for self-maintaining systems that can learn continually, as data arrives. In environments where data evolves, we need architectures that manage Machine Learning (ML) models in production, adapt to shifting data distributions, cope with outliers, retrain when necessary, and …

2019-03-12abs ↗pdf ↗

Unified framework for adaptive learning systems using consolidation and expansion operations.

problem Managing the balance between consolidating known knowledge and expanding into new evidence in adaptive learning systems.
method Introduces Consolidation-Expansion Operator Mechanics (OpMech) with the order-gap metric to control the balance.
result The order-gap signal provides real-time control and termination guarantees for adaptive learning systems.

Computational Intelligence (CI) is a sub-branch of Artificial Intelligence paradigm focusing on the study of adaptive mechanisms to enable or facilitate intelligent behavior in complex and changing environments. There are several paradigms of CI [like artificial neural networks, evolutionary computations, swarm intelli…

2010-06-09abs ↗pdf ↗

A new method helps deep learning systems adapt to changing conditions.

problem Deep learning systems struggle with environmental drifts and long healing cycles.
method Intentional forgetting integrated into continual learning to overcome issues.
result Dr. DRL reduces healing time and fine-tuning episodes by 18.74% and 17.72% respectively.

Multi-hop inference is necessary for machine learning systems to successfully solve tasks such as Recognising Textual Entailment and Machine Reading. In this work, we demonstrate the effectiveness of adaptive computation for learning the number of inference steps required for examples of different complexity and that l…

2016-10-24abs ↗pdf ↗

Improved RL algorithm stabilizes unknown linear systems with polynomial regret.

problem Learning and stabilizing unknown linear dynamical systems.
method Proposes an algorithm with an improved exploration strategy for fast stabilization.
result Achieves ildeO(T) ilde{\mathcal{O}}(\sqrt{T}) regret after TT time steps.

Adaptive filters are applied in several electronic and communication devices like smartphones, advanced headphones, DSP chips, smart antenna, and teleconference systems. Also, they have application in many areas such as system identification, channel equalization, noise reduction, echo cancellation, interference cancel…

2019-09-06abs ↗pdf ↗

NAC-FL optimizes model updates in FL systems by adapting compression to network congestion.

problem Federated Learning systems face congestion and delays in data exchanges.
method NAC-FL dynamically adjusts client compression based on network congestion.
result NAC-FL reduces training time and achieves robust performance improvements.

Machine learning approaches have seen considerable applications in human movement modeling, but remain limited for motor learning. Motor learning requires accounting for motor variability, and poses new challenges as the algorithms need to be able to differentiate between new movements and variation of known ones. In t…

2020-02-11abs ↗pdf ↗

Adaptive probabilistic load forecasting improves performance in power systems.

problem Complexity of electricity load forecasting due to changing drivers and local generation.
method Adaptive probabilistic approach using Kalman filter and online gradient descent.
result Adaptive probabilistic forecasts improve performance in both point and probabilistic forecasting.

KSOS improves kernel learning for dynamical systems via global optimization.

problem Challenges in selecting optimal kernels and tuning parameters in traditional kernel-based methods.
method Global optimization framework with kernel-based surrogate functions.
result KSOS consistently outperforms gradient descent in predicting dynamical systems.

Adapting policy learning for data collected from evolving systems.

problem Challenges in learning optimal policies from adaptively collected data.
method Proposes an algorithm based on generalized augmented inverse propensity weighted (AIPW) estimators to control worst-case estimation variance.
result Achieves minimax rate optimal regret guarantees even with diminishing exploration.

Introduces GFC for learning complex dynamical systems with geometric constraints.

problem Challenges in accurately modeling and predicting complex dynamical systems with geometric constraints.
method Geometric Contact Flows (GFC) using Riemannian and Contact geometry as inductive biases.
result Ensemble of contactomorphisms adapt the latent contact Hamiltonian model to target dynamics while preserving desirable properties.