Sequence-to-sequence (seq2seq) based ASR systems have shown state-of-the-art performances while having clear advantages in terms of simplicity. However, comparisons are mostly done on speaker independent (SI) ASR systems, though speaker adapted conventional systems are commonly used in practice for improving robustness…
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,742 papers · 148 categories
Trend · papers per month
48 results for “adaptive systems”
Meta-reinforcement learning improves fault-adaptive control efficiency.
problem Adaptive control under abrupt system faults with strict time constraints.
method Model-agnostic meta learning (MAML) with a fault library of prior policies.
result Improved sample efficiency and quick adaptation to new faults.
Perfect adaptation in systems is identified and tested using graphical tools.
problem Identifying perfect adaptation in dynamical systems.
method Causal ordering algorithm and graphical representations of dynamical systems.
result Sufficient graphical and testing conditions for perfect adaptation.
Recent developments in machine-learning algorithms have led to impressive performance increases in many traditional application scenarios of artificial intelligence research. In the area of deep reinforcement learning, deep learning functional architectures are combined with incremental learning schemes for sequential …
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.
Identification and Adaptive Control of Markov Jump Systems: Sample Complexity and Regret Boundscs.LG
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 regret, improving to with partial knowledge.
A Theory of Complex Adaptive Learning and a Non-Localized Wave Equation in Quantum Mechanicsq-fin.GN
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.
Technical Report: Adaptive Control for Linearizable Systems Using On-Policy Reinforcement Learningcs.LG
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.
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.
Adaptive neural network approximates stochastic system densities.
problem Approximating high-dimensional stochastic dynamical systems.
method Temporal KRnet (tKRnet) trained with adaptive collocation points and temporal decomposition.
result Improves density approximation for stochastic systems without curse of dimensionality.
Modified dynamical systems retain Turing universality.
problem Embedding Turing machines into dynamical systems.
method Exploring flows with adapted 1-forms and homogeneity.
result Even slight modifications can lead to Turing universality.
Adapts MBDOE for real-time parameter estimation in complex systems.
problem Costly posterior inference and design optimization in nonlinear systems.
method Combines DAD with differentiable mechanistic models for real-time parameter estimation.
result Demonstrated on four systems, including a DC motor.
New algorithm reduces control error in systems with changing dynamics.
problem Online control of systems with time-varying linear dynamics.
method Introduces adaptive regret metric and a novel meta-algorithm.
result First adaptive regret bound for online convex optimization with memory.
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 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 in the time horizon accurately capture control-theoretic parameters.
Locally adaptive nearest neighbors improve automated systems' performance and are easier to interpret.
problem Improving automated systems' performance and interpretability.
method Developed a method for k nearest neighbors algorithms to learn locally adaptive metrics.
result Locally adaptive metrics improve performance and are interpretable.
Most existing examples of full conformal predictive systems, split-conformal predictive systems, and cross-conformal predictive systems impose severe restrictions on the adaptation of predictive distributions to the test object at hand. In this paper we develop split-conformal and cross-conformal predictive systems tha…
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.
RAID algorithm detects anomalies in real-time IoT systems.
problem Anomaly detection limitations in multivariate dynamic processes.
method Adapts to non-stationary effects and handles data drift.
result Improved detection accuracy and root cause isolation.
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 …
New method handles robust and adaptive control of linear systems with non-convex costs.
problem Robust and adaptive control of linear systems with unknown parameters.
method Combining non-asymptotic linear regression, interval prediction, and tree-based planning.
result First end-to-end suboptimality analysis for robust and adaptive MPC with non-convex costs.
On Data-Selective Learningeess.SP
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…
Recursive experts improve dynamic sequential learning systems.
problem Adapt to changing environments in sequential learning.
method Design hyper-experts that recursively merge to achieve optimal performance.
result Achieve minimax optimal regret bounds up to constant factors.
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.
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.
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.
Wireless systems perform rate adaptation to transmit at highest possible instantaneous rates. Rate adaptation has been increasingly granular over generations of wireless systems. The base-station uses SINR and packet decode feedback called acknowledgement/no acknowledgement (ACK/NACK) to perform rate adaptation. SINR i…
Adaptive template systems: Data-driven feature selection for learning with persistence diagramscs.LG
Feature extraction from persistence diagrams, as a tool to enrich machine learning techniques, has received increasing attention in recent years. In this paper we explore an adaptive methodology to localize features in persistent diagrams, which are then used in learning tasks. Specifically, we investigate three algori…
TSAC achieves optimal frequentist regret in adaptive control of LQRs.
problem Adaptive control of stabilizable linear-quadratic regulators with unknown dynamics.
method Thompson Sampling (TS) for adaptive control of LQRs, with a novel early exploration strategy.
result Achieves regret, optimal for multidimensional systems.
Stabilization of linear systems with unknown dynamics is a canonical problem in adaptive control. Since the lack of knowledge of system parameters can cause it to become destabilized, an adaptive stabilization procedure is needed prior to regulation. Therefore, the adaptive stabilization needs to be completed in finite…
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.
The main challenge for adaptive regulation of linear-quadratic systems is the trade-off between identification and control. An adaptive policy needs to address both the estimation of unknown dynamics parameters (exploration), as well as the regulation of the underlying system (exploitation). To this end, optimism-based…
New algorithm detects and adapts to changes in real-time data streams.
problem Adapting to fast-changing data in real-time systems.
method Concept drift detection followed by prototype-based adaptation.
result Stable and quick adjustments during model adaptation.
Designs adaptive controller for networked control systems with wireless data transmission.
problem Adaptive control in networked systems with unreliable wireless channels.
method Upper Confidence Bounds for Networked Control Systems (UCB-NCS) learning rule.
result Non-asymptotic performance guarantees with a regret bound of O(C√T).
Crowdsourcing platforms provide marketplaces where task requesters can pay to get labels on their data. Such markets have emerged recently as popular venues for collecting annotations that are crucial in training machine learning models in various applications. However, as jobs are tedious and payments are low, errors …
First order optimization algorithms play a major role in large scale machine learning. A new class of methods, called adaptive algorithms, were recently introduced to adjust iteratively the learning rate for each coordinate. Despite great practical success in deep learning, their behavior and performance on more genera…
Sparse Meta Networks for Sequential Adaptation and its Application to Adaptive Language Modellingcs.NE
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.
Power system emergency control is generally regarded as the last safety net for grid security and resiliency. Existing emergency control schemes are usually designed off-line based on either the conceived "worst" case scenario or a few typical operation scenarios. These schemes are facing significant adaptiveness and r…
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%.
A new filter design improves system identification accuracy.
problem Improving system identification accuracy for various system types.
method Generalized proportionate-type normalized subband adaptive filter (GPtNSAF) using least squares on subband errors with a sparsity penalty.
result GPtNSAF benefits from increasing subbands more than sparsity for quasi-sparse or dispersive systems, and both aspects are complementary for sparse systems.
Consensus-based adaptive sampling and approximation for high-dimensional energy landscapesphysics.comp-ph
Unified framework for sampling and approximating high-dimensional energy landscapes.
problem Sampling and approximating complex energy landscapes in physical systems with constraints and energy barriers.
method Formulates a minimax optimization problem that jointly adapts surrogate approximation and adaptive sampling.
result Demonstrates effectiveness in biomolecular systems with up to 30 collective variables.
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.
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…
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.
State-of-the-art speaker recognition systems comprise an x-vector (or i-vector) speaker embedding front-end followed by a probabilistic linear discriminant analysis (PLDA) backend. The effectiveness of these components relies on the availability of a large collection of labeled training data. In practice, it is common …
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.
Thermodynamic Machine Learning through Maximum Work Productioncond-mat.stat-mech
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.