DAAN dynamically adapts adversarial learning for better domain adaptation.
problem Dynamic evaluation of global vs local domain distributions for adversarial learning.
method Dynamic Adversarial Adaptation Network (DAAN) that dynamically learns domain-invariant representations.
result DAAN achieves better classification accuracy compared to state-of-the-art methods.
Adaptive sampling for multimodal distributions converges faster than classical methods.
problem Sampling from multimodal distributions efficiently.
method Adaptive linear dynamics with adaptive diffusion coefficients and vector fields, interpreted as weighted Wasserstein gradient flows.
result Derivative-free dynamics can achieve significantly faster convergence for nonconvex potentials.
Paper proposes DDA for better transfer learning performance.
problem Domain discrepancy between source and target distributions.
method Dynamic Distribution Adaptation (DDA) to evaluate and adapt distribution importance.
result DDA improves transfer learning performance on various tasks.
A model is presented of the market dynamics to emphasis the effects of increasing returns to scale, including the description of the born and death of the adaptive producers. The evolution of market structure and its behavior with the technological shocks are discussed. Its dynamics is in good agreement with some empir…
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.
GRAM enhances deep RL for reliable real-world deployment.
problem Generalizing deep RL across in-distribution and out-of-distribution scenarios.
method Introduces a robust adaptation module and a joint training pipeline.
result GRAM achieves strong generalization performance in simulations and hardware.
Extends DRFGP to make GPs more robust and adaptive for dynamic, noisy data.
problem Limited scalability, static targets, and brittleness to outliers in GPs.
method Introduces robust-filtering update and dynamic adaptation mechanism.
result Enhanced stability and accuracy in modeling dynamic, noisy data.
Proposes a method to forecast non-stationary time series.
problem Challenges of non-stationary conditional distributions in deep learning.
method Bayesian dynamic model + deep conditional distribution model.
result Adapts to non-stationary time series better than state-of-the-art solutions.
A new algorithm flattens multi-modal distributions for better deep learning.
problem Bayesian learning in big data with multi-modal distributions.
method Contour Stochastic Gradient Langevin Dynamics (CSGLD) algorithm.
result The CSGLD algorithm avoids local traps in deep neural networks.
FADE adapts machine learning models to evolving data efficiently.
problem Sequential covariate shift in dynamic environments.
method FADE uses Fisher information geometry for robust learning under SCS.
result FADE achieves up to 19% higher accuracy under severe shifts.
In an adaptive population which models financial markets and distributed control, we consider how the dynamics depends on the diversity of the agents' initial preferences of strategies. When the diversity decreases, more agents tend to adapt their strategies together. This change in the environment results in dynamical…
Bayesian Federated Learning improves model reliability in dynamic environments.
problem Uncertainty quantification and robust adaptation in distributed learning.
method Proposes a continual BFL framework using SGLD for sequential updates and continual learning challenges.
result Continual Bayesian updates preserve knowledge and adapt to evolving data.
Adaptive populations such as those in financial markets and distributed control can be modeled by the Minority Game. We consider how their dynamics depends on the agents' initial preferences of strategies, when the agents use linear or quadratic payoff functions to evaluate their strategies. We find that the fluctuatio…
Dynamic risk measures follow law invariance principles over time.
problem Tackles dynamic risk measurement principles.
method Shows equivalence between adapted law invariance and recursive one-step conditional-law representation for time-consistent risk measures.
result Identifies adapted law invariance as the dynamic counterpart of ordinary law invariance.
The multi-armed bandit (MAB) problem is a classic example of the exploration-exploitation dilemma. It is concerned with maximising the total rewards for a gambler by sequentially pulling an arm from a multi-armed slot machine where each arm is associated with a reward distribution. In static MABs, the reward distributi…
An adaptive clustering algorithm learns from evolving data without manual tuning.
problem Clustering in dynamic data environments where distributions change over time.
method ART-based topological clustering with self-adjusting vigilance parameter.
result The algorithm outperforms state-of-the-art methods in clustering performance and continual learning.
Paper tackles online adaptation to changing label distributions.
problem Adapting machine learning models to changing label distributions in real-world settings.
method Leverages novel analysis to show estimation of expected test loss is possible without true labels. Proposes adaptation algorithms inspired by classical online learning techniques.
result Empirically verified that OGD is particularly effective and robust to various label shift scenarios.
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.
OSAMD adapts online to changing distributions with limited labels.
problem Models struggle with continual distribution shifts and expensive labeling in changing environments.
method Online Active Continual Adaptation with OSAMD, an online teacher-student structure and margin-based criterion.
result OSAMD achieves favorable dynamic regret bounds under changing environments with limited labels.
KOMET identifies Koopman operators from model parameter trajectories to adapt to evolving data distributions.
problem Adaptation of parametric models to non-stationary environments.
method Data-driven framework using Koopman operator identification and Extended Dynamic Mode Decomposition (EDMD).
result KOMET achieves high autonomous-rollout accuracies of 0.981 to 1.000 over 100 time steps on various drifting datasets.
Efficient EP algorithm improves smoothing distribution inference in financial models.
problem Computational intractability of smoothing distribution in high dimensions.
method Adapted expectation propagation (EP) algorithms for the unified skew-normal family.
result Accuracy gains in financial illustrations over existing approximate algorithms.
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.
New model explains price dynamics of Bitcoin with psychological factors.
problem Understanding price variations in cryptocurrency markets with psychological factors.
method Extended agent-based model with heterogeneous psychological parameters.
result Model shows diverse dynamics based on psychological correlation.
EvoMSN tackles time series forecasting under distribution shifts by evolving multi-scale normalization.
problem Accurate long-term time series forecasting under complex distribution shifts.
method EvoMSN framework with multi-scale statistics prediction and adaptive ensembling for collaborative updating.
result Improves forecasting performance of five mainstream methods on benchmark datasets.
Paper tackles dynamic label shift in online learning, achieving optimal performance.
problem Adapting to changing class marginals in online supervised and unsupervised learning.
method Develops novel algorithms reducing adaptation to online regression, achieving optimal dynamic regret.
result Achieves superior performance in various online label shift scenarios.
Optimal asset allocation strategy outperforms stochastic benchmark.
problem Achieving higher terminal wealth than a stochastic benchmark.
method Data-driven Neural Network optimization framework for dynamic asset allocation.
result Optimal adaptive strategy outperforms benchmark with higher median and right-skewed terminal wealth.
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.
PRZI traders adapt their quote-prices based on a strategy parameter s, affecting market dynamics.
problem Understanding the dynamics of continuous double auction markets with adaptive traders.
method Introduced a new zero-intelligence trader PRZI that uses a parameterised probability distribution to generate quote-prices. Used a stochastic hill-climber algorithm to adapt strategies based on market conditions.
result The co-evolutionary dynamics of PRZI traders can lead to rich and complex market behaviors, including periods of stability and change.
Adaptive Langevin dynamics reduces bias in Bayesian inference with mini-batching.
problem Bias in posterior sampling due to mini-batching in Bayesian inference.
method Adaptive Langevin dynamics with dynamical friction to correct noise.
result Quantified bias in posterior distribution due to mini-batching.
Neural HMM with AGA captures multi-scale dynamics in financial markets.
problem Capturing multi-scale temporal dynamics in financial markets.
method Parallel multi-resolution encoders, adaptive gating, and multi-head attention.
result Outperforms fixed-resolution baselines in predicting price movements and liquidity shocks.
Method predicts how probability distributions evolve over time.
problem Predicting how systems described by probability distributions evolve under different conditions.
method Wasserstein Parallel Transport
result Wasserstein Parallel Transport provides counterfactual comparisons of distributional dynamics.
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.
A new approach for test-time adaptation detects and reacts to distribution shifts.
problem Improving test-time accuracy under distribution shifts.
method Online self-training with a detection tool based on entropy values and betting martingales.
result The classifier's entropy values match those of the source domain, building invariance to distribution shifts.
A quantum walk-based method for generating precise probability distributions efficiently.
problem Generating high-precision probability distributions for various applications.
method Integrates variational quantum circuits with split-step quantum walks to dynamically tune coin parameters and evolve quantum states.
result Achieves high simulation fidelity and reduces computational overhead compared to conventional methods.
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…
ANADDH uses deep learning to improve volatility risk management.
problem Traditional Vega hedging strategies are inadequate for rapidly changing markets.
method Combines distributional reinforcement learning with adaptive Nesterov acceleration.
result Significant performance gains over existing hedging techniques.
Paper presents a self-adaptive learning model for robust classification and regression.
problem Dealing with various datasets of different complexity.
method Combines DNDN and DSP, an end-to-end training approach with multiple randomly initialized softmax layers and adaptive soft pruning.
result The model demonstrates no performance loss compared with unpruned models and higher robustness over different data and feature distributions.
DoubleAdapt improves stock trend forecasting by adapting models to evolving data.
problem Incremental learning for stock trend forecasting is challenging due to distribution shifts.
method DoubleAdapt framework with two adapters for data and model adaptation.
result DoubleAdapt achieves state-of-the-art predictive performance on real-world stock datasets.
A new method computes high-dimensional optimal transport using flow neural networks.
problem Computing optimal transport for high-dimensional data.
method Optimizing a flow model to minimize transport cost between two arbitrary distributions.
result Trained optimal transport flow enables downstream tasks like DRE and domain adaptation.
Based on the daily data of American and Chinese stock markets, the dynamic behavior of a financial network with static and dynamic thresholds is investigated. Compared with the static threshold, the dynamic threshold suppresses the large fluctuation induced by the cross-correlation of individual stock prices, and leads…
The study explores how agents learn and adapt preferences in dynamic environments.
problem Adaptive behavior and preference learning in reinforcement learning tasks.
method The approach involves self-supervised learning of preferences, distinguishing between environmental and intrinsic observations, and evaluating with model-free and model-based reinforcement learning.
result The methodology successfully minimizes surprisal and expected free energy in dynamic environments.
Adaptive sampling improves graph diffusion models by maintaining uniform information speed.
problem Standard diffusion models overlook non-homogeneous dynamics on complex manifolds.
method Information-geometric framework using Fisher-Rao metric and Drift Variation Score (DVS).
result DVS solver ensures uniform rate of distributional change, improving structural fidelity and efficiency.
Dynamic treatment regimes are of growing interest across the clinical sciences as these regimes provide one way to operationalize and thus inform sequential personalized clinical decision making. A dynamic treatment regime is a sequence of decision rules, with a decision rule per stage of clinical intervention; each de…
This paper tackles continuous covariate shift by adaptively training predictors.
problem Continuous covariate shift where input distributions change over time.
method Online density ratio estimation method to adaptively train predictors.
result Excess risk guarantee for the predictor through dynamic regret bound.
The agent-based model of stock price dynamics on a directed evolving complex network is suggested and studied by direct simulation. The stationary regime is maintained as a result of the balance between the extremal dynamics, adaptivity of strategic variables and reconnection rules. The inherent structure of node agent…
Bayesian method adapts to unknown distribution shifts in online learning.
problem Online learning with unknown and irregular distribution shifts.
method Bayesian inference with change-point detection and beam search.
result Improves adaptation to new data distributions over state-of-the-art methods.
Framework improves gradient estimation for faster training convergence.
problem Efficiently estimating noisy gradients in stochastic optimization.
method Dynamic adaptive importance sampling combining multiple distributions.
result Adaptively weighted multiple importance sampling yields superior gradient estimates.
Algorithm improves sample efficiency for dynamic task adaptation.
problem Sample inefficiency in imitation learning for changing task distributions.
method Assigns importance weights to past demonstrations for meta adaptation.
result Robot adapts to unseen environments with few demonstrations.