We derive a class of macroscopic differential equations that describe collective adaptation, starting from a discrete-time stochastic microscopic model. The behavior of each agent is a dynamic balance between adaptation that locally achieves the best action and memory loss that leads to randomized behavior. We show tha…
Model shows speculative trading agents create price bubbles with increasing risk of crash.
problem Speculative trading and price bubbles creation.
method Agent-based modeling with adaptive stock-to-bond ratios and risk levels.
result Persistent price bubbles and growing risk of crash.
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.
Paper proposes efficient co-adaptation of robot morphology and behavior.
problem Infeasibility of co-adapting morphology and behavior in robots due to long manufacturing times and need for new controllers.
method Uses deep reinforcement learning, specifically the soft actor critic algorithm, to automatically and efficiently co-adapt robot morphology and behavior.
result Reduces the number of morphologies and behaviors tested, making co-adaptation more data-efficient.
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.
Unintended effects from scaling neural network outputs with adaptive learning rates.
problem Adaptive learning rate optimization's behavior is altered by output scaling, leading to misinterpretation.
method Presented a modified optimization algorithm to mitigate unintended effects.
result Adaptive learning rate's effectiveness is significantly impacted by output scaling, especially for small scaling factors.
Trading bubbles form when traders adapt to price mismatches.
problem Self-sustained price bubbles driven by adaptive trading behavior.
method Multi-agent model illustrating price bubble formation and statistical properties.
result Price bubbles can be driven by adaptive investment strategies.
AIPS improves ranking policy evaluation by adapting to diverse user behavior.
problem Inaccurate Off-Policy Evaluation of ranking policies due to high variance under diverse user behavior.
method Developed Adaptive IPS (AIPS) that adapts to different user behaviors and minimizes MSE.
result AIPS achieves minimum variance among unbiased estimators and provides significant empirical accuracy improvement.
New neural network learns adaptive behaviors inspired by neuromodulation.
problem Current AI lacks the ability to adapt to changing environments.
method Inspired by cellular neuromodulation, a new deep neural network architecture is designed.
result Neuromodulation-based networks improve adaptation in meta-reinforcement learning tasks.
Reinforcement Learning AI commonly uses reward/penalty signals that are objective and explicit in an environment -- e.g. game score, completion time, etc. -- in order to learn the optimal strategy for task performance. However, Human-AI interaction for such AI agents should include additional reinforcement that is impl…
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.
New framework shows strategic behavior is actually a form of causal modeling.
problem Designing classifiers that incentivize strategic behavior to improve quality.
method Developed a causal framework to distinguish between gaming and improvement.
result Proved any procedure for designing incentive classifiers must solve a causal inference problem.
Paper proposes a beta distribution method for detecting concept drift in adaptive classifiers.
problem Adaptive classifiers need to detect and respond to concept drift in real-time data streams.
method The paper introduces a beta distribution model to monitor model error and identify abnormal behavior as drift.
result The method effectively detects abrupt changes in model error, improving classifier performance.
FinHEAR combines LLMs with human expertise for better financial decision-making.
problem Challenges in financial decision-making for language models.
method Multi-agent framework with specialized LLMs for historical analysis, event interpretation, and expert retrieval.
result FinHEAR outperforms baselines in financial tasks with higher accuracy and risk-adjusted returns.
The paper develops classifiers that encourage positive adaptation in machine learning settings.
problem Strategic behavior by decision subjects leads to performance loss in machine learning models.
method Formulates a two-stage game to characterize optimal strategies for model designers and decision subjects.
result Trained classifiers maintain accuracy while inducing higher improvement and less manipulation.
Researchers adaptively analyze market regimes to reveal investor behavior shifts.
problem Market relationships shift across different regimes, affecting investor behavior.
method Combining Kalman filtering, Markov-switching, and asymmetric response estimation.
result Foreign investors' predictive power increases during crises, while individual investors react more strongly to positive shocks.
The article presents methods to select models from behavioral learning data, with applications to contextual bandits.
problem Model selection for behavioral learning data, especially in non-stationary environments.
method Two model selection methods: a general hold-out procedure and an AIC-type criterion, adapted for non-stationary dependent data.
result Theoretical error bounds for these methods are close to those of the standard i.i.d. case.
A new algorithm adapts to changing user behaviors in finance.
problem Adapting to changing user behaviors in financial recommendations.
method History-Augmented Collaborative Filtering using a custom neural network.
result The algorithm provides dynamic financial recommendations.
Market crowd trading behavior and volume impact stock prices in China.
problem Little known about the role of trading volume in market behavior.
method Adaptive hypotheses tested on Chinese stock market data.
result Market crowd trades efficiently and achieves agreement on prices.
MaxVA improves Adam's step sizes by maximizing gradient variance.
problem Unstable or extreme adaptive learning rates in Adam.
method Maximizing the variance of gradient coordinates in Adam's running mean of squared gradients.
result Faster adaptation and more desirable convergence behaviors than Adam.
New approach allows deep learning to adapt to new tasks without explicit training.
problem How to reuse deep learning knowledge for new tasks without explicit training.
method Homoiconic Meta-Mapping (HoMM) that transforms task representations.
result Zero-shot remapping of behavior to adapt to new tasks.
Robots learn diverse behaviors to adapt to changing environments.
problem Robots struggle to adapt to new environments with unexpected changes.
method Generative adversarial policy networks to learn and sample a diverse set of behaviors.
result Robots can hit targets more often in changing environments.
Introduces LoCA regret to evaluate model-based RL methods.
problem Lack of consistent metrics to evaluate model-based RL methods.
method Inspired by neuroscience, introduces LoCA regret to measure model-based behavior.
result LoCA regret can identify model-based behavior and assess how close methods are to optimal model-based behavior.
ProMP improves Meta-RL by better handling credit assignment.
problem Poor credit assignment in Meta-RL leads to suboptimal performance.
method Develops a novel meta-learning algorithm controlling pre-adaptation and adapted policies.
result Significantly improves sample-efficiency and asymptotic performance.
Study examines how traders with asymmetric information and adaptive learning strategies affect market efficiency.
problem Effect of traders' strategic behavior on market efficiency and informational asymmetry.
method Examines a market with boundedly rational, asymmetrically informed traders using multiarmed bandit algorithms.
result Strategically acting traders can lead to more efficient markets than purely competitive ones under certain conditions.
We study the relation between the trading behavior of agents and volatility in toy markets of adaptive inductively rational agents. We show that excess volatility, in such simplified markets, arises as a consequence of {\em i)} the neglect of market impact implicit in price taking behavior and of {\em ii)} excessive re…
A nonlinear wave alternative for the standard Black-Scholes option-pricing model is presented. The adaptive-wave model, representing 'controlled Brownian behavior' of financial markets, is formally defined by adaptive nonlinear Schrödinger (NLS) equations, defining the option-pricing wave function in terms of the stock…
Paper models market dynamics using bull and bear forces.
problem Complex market dynamics influenced by biases and narratives.
method Bias to Behavior from Bull-Bear Dynamics (B4) model.
result Model predicts market trends with superior performance and interpretable insights.
The paper explores how structured representations influence learning dynamics in neural networks.
problem Understanding the training dynamics of deep neural networks.
method Investigates a family of enriched transformation layers with constrained pathways and adaptive corrections.
result Improved robustness, smoother optimization, and scalable depth behavior are achieved through structured representations.
A new approach combines prior knowledge with learning to adapt quickly to new tasks.
problem Adapting quickly to new tasks using prior knowledge.
method Combines behavior prior, robust off-policy learning, and value function representation.
result Achieves competitive adaptation performance compared to meta reinforcement learning baselines.
Curious Replay improves model-based reinforcement learning agents' adaptability.
problem Existing model-based reinforcement learning agents struggle to adapt quickly to changing environments.
method Curious Replay uses a curiosity-based priority signal for prioritized experience replay tailored to model-based agents.
result Agents using Curious Replay achieve improved performance in exploration and on benchmarks.
GRASP simplifies Bayesian regression with grouped predictors using an adaptive NBP prior.
problem Regression with grouped predictors and adaptive shrinkage.
method Normal Beta Prime (NBP) prior with tunable hyperparameters for flexible sparsity control.
result Empirical validation of robust and versatile GRASP across various sparsity and signal-to-noise ratios.
ABPS improves RL training efficiency by sharing policies and evolving hyper-params.
problem Data inefficiency in training deep RL models for real-world applications.
method ABPS: adaptive behavior policy sharing; ABPS-PBT: hybridizing ABPS with PBT for evolving hyper-params.
result ABPS achieves superior performance and reduced variance compared to conventional hyper-parameter tuning.
ABS dynamically adjusts batch size based on policy stability, improving RL performance.
problem Diminishing returns with large batch sizes in RL due to non-stationary data.
method Adaptive Batch Scaling (ABS) with Behavioral Divergence metric.
result Larger batch sizes can improve RL performance, contrary to conventional wisdom.
Mechanisms of human color vision are characterized by two phenomenological aspects: the system is nonlinear and adaptive to changing environments. Conventional attempts to derive these features from statistics use separate arguments for each aspect. The few statistical approaches that do consider both phenomena simulta…
Paper studies attacks on bandit algorithms and shows how attackers can manipulate data to hijack behavior.
problem Potential attacks on bandit algorithms can cause catastrophic loss in real-world applications.
method Proposes a framework of offline and online attacks on bandit algorithms using convex optimization and adaptive strategies.
result Attackers can force bandit algorithms to pull target arms with high probability by manipulating data.
NAS model improves social recommendation accuracy using neural attention.
problem Capturing and weighing friends' preferences in social recommendation systems.
method Proposes a Neural Attention mechanism (NAS) for Social collaborative filtering.
result NAS model outperforms state-of-the-art methods in publicly available datasets.
The human brain is able to learn, generalize, and predict crossmodal stimuli. Learning by expectation fine-tunes crossmodal processing at different levels, thus enhancing our power of generalization and adaptation in highly dynamic environments. In this paper, we propose a deep neural architecture trained by using expe…
The paper studies the asymptotic behavior of adversarial training under ℓ∞-perturbation.
problem Theoretical guarantees for sparsity-recovery in adversarial training.
method Investigation of the asymptotic distribution of the adversarial training estimator in generalized linear models.
result The asymptotic distribution of the adversarial training estimator under ℓ∞-perturbation could have a positive probability mass at 0 when the true parameter is 0. Most learning algorithms are not invariant to the scale of the function that is being approximated. We propose to adaptively normalize the targets used in learning. This is useful in value-based reinforcement learning, where the magnitude of appropriate value approximations can change over time when we update the polic…
Constrained adaptive filtering algorithms inculding constrained least mean square (CLMS), constrained affine projection (CAP) and constrained recursive least squares (CRLS) have been extensively studied in many applications. Most existing constrained adaptive filtering algorithms are developed under mean square error (…
The paper tackles contextual bandits with continuous actions using smoothing and zooming techniques.
problem Learning with continuous action spaces in the context of contextual bandits.
method The approach involves smoothing and zooming techniques to handle the continuous action space and unknown smoothness parameters.
result Improved regret bounds and adaptive algorithms for contextual bandits with continuous actions.
Proposes ADC for cross-domain recommendation balancing user preferences.
problem Users' preferences change across different domains (e.g., social media, e-commerce).
method Designs a neural architecture and cross-domain loss function to adaptively balance user preferences.
result ADC model effectively balances the impact of domains with different complexities.
Paper analyzes adaptive ISTA with MAD for LASSO problem.
problem Finding solutions to LASSO problems without tuning λ. method Adaptive ISTA with median absolute deviation (MAD) for estimating noise level.
result Local linear convergence and global convergence of the algorithm.
A key drawback of the current generation of artificial decision-makers is that they do not adapt well to changes in unexpected situations. This paper addresses the situation in which an AI for aerial dog fighting, with tunable parameters that govern its behavior, will optimize behavior with respect to an objective func…
Consistent estimator derived for confounding strength in observational data.
problem Estimating confounding strength in observational data is challenging due to unobserved confounders.
method Derived and adapted a consistent estimator using tools from random matrix theory.
result The original estimator is not consistent, but an adapted one is.
AdaScale SGD adapts learning rates for large-batch training efficiently.
problem Adapting learning rates for large-batch training to balance speed-ups and model quality.
method Adaptive learning rate adaptation based on gradient variance.
result AdaScale achieves reliable speed-ups for a wide range of batch sizes without degrading model quality.
Multi-agent models have been used in many contexts to study generic collective behavior. Similarly, complex networks have become very popular because of the diversity of growth rules giving rise to scale-free behavior. Here we study adaptive networks where the agents trade ``wealth'' when they are linked together while…