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

109218326435 · Jun 202019922001200920172026
48 results for Adaptive Switching Factor

HireVAE adapts to market regimes for online stock prediction.

problem Building an online and adaptive factor model for stock prediction.
method HireVAE uses a hierarchical latent space to estimate latent factors from historical market information.
result HireVAE outperforms previous methods in active returns across benchmarks.

Efficient algorithms for online convex optimization with limited switching decisions.

problem Online convex optimization with limited switching decisions.
method Presented computationally efficient algorithms for both general and strongly convex losses.
result Regret bounds of O(T/S)O(T/S) for general convex losses and O~(T/S2)\widetilde O(T/S^2) for strongly convex losses.

Study on adaptivity constraints in linear contextual bandits with optimal design.

problem Impact of adaptivity constraints on linear contextual bandits.
method Two models of limited adaptivity: batch learning and rare policy switches. Proposed distributional optimal design.
result Achieves minimax-optimal regret with optimal number of policy switches and batches.

Audit fees change based on company and economic factors during auditor switching.

problem Understanding how audit fees change when auditors switch firms.
method Examined the impact of auditor switching on audit fees, considering company characteristics and economic data.
result The direction and magnitude of audit fee changes during switching depend on economic stability and company characteristics.

Adaptive Bayesian Optimization for resource-constrained experiments with switching costs.

problem Sequential experimental design with varying costs for changing design variables.
method Adapted batch algorithms to sequential problem, proposing cost-aware and cost-ignorant methods.
result Cost-aware algorithm outperforms tuned process-constrained algorithms in all settings considered.

We take initial steps in studying PAC-MDP algorithms with limited adaptivity, that is, algorithms that change its exploration policy as infrequently as possible during regret minimization. This is motivated by the difficulty of running fully adaptive algorithms in real-world applications (such as medical domains), and …

2019-05-30abs ↗pdf ↗

We study the power of different types of adaptive (nonoblivious) adversaries in the setting of prediction with expert advice, under both full-information and bandit feedback. We measure the player's performance using a new notion of regret, also known as policy regret, which better captures the adversary's adaptiveness…

2013-02-18abs ↗pdf ↗

Optimal switching regret for all segmentations in online convex optimisation.

problem Non-stationary online convex optimisation problems.
method Developed an efficient algorithm to achieve optimal switching regret on every possible segmentation.
result Achieved asymptotically optimal switching regret on every possible segmentation simultaneously.

DSARF models complex spatio-temporal data with deep switching auto-regressive factors.

problem Forecasting complex spatio-temporal data with recurring patterns.
method Deep switching auto-regressive factorization (DSARF) with stochastic variational inference.
result DSARF outperforms state-of-the-art methods in long- and short-term prediction accuracy.

New method forecasts time series with changing variances.

problem Real-world processes with changing variances cannot be captured by classical models.
method State-space model with Markov switching variances, using online learning and expert aggregation.
result Proposed method outperforms traditional expert aggregation and is robust to misspecification.

New RL algorithm reduces policy switching cost to loglog(T) with similar regret.

problem Low policy switching cost in real-life RL applications.
method Stage-wise exploration and adaptive policy elimination.
result Regret of O(HSAloglogT)O(HSA \log\log T) with O(HSAloglogT)O(HSA \log\log T) switching cost.

A new policy switching technique improves offline RL performance.

problem Challenges in adapting off-policy algorithms to different datasets and tasks.
method Combines off-policy RL and BC, using epistemic uncertainty for policy switching.
result Outperforms individual algorithms and state-of-the-art methods on benchmarks.

SAHMM-VAE separates sources adaptively using hidden Markov priors.

problem Unsupervised blind source separation.
method Source-wise adaptive Hidden Markov prior variational autoencoder.
result Different latent dimensions align with different source-specific temporal organizations.

Efficient RL algorithms for linear function approximation with limited adaptivity constraints.

problem Limited adaptivity in reinforcement learning with linear function approximation.
method Proposed two efficient online RL algorithms for episodic linear Markov decision processes under batch learning and rare policy switch models.
result Achieved efficient regret bounds for both batch learning and rare policy switch models, with substantial reduction in adaptivity.

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.

We solve non-Markovian optimal switching problems in discrete time on an infinite horizon, when the decision maker is risk aware and the filtration is general, and establish existence and uniqueness of solutions for the associated reflected backward stochastic difference equations. An example application to hydropower …

2019-10-09abs ↗pdf ↗

The article uses dynamic factor allocation to improve portfolio performance by integrating regime-switching signals.

problem Improving portfolio performance through dynamic factor allocation.
method The authors apply the sparse jump model (SJM) to identify bull and bear market regimes for individual factors, then fine-tune hyperparameters using a hypothetical single-factor long-short strategy. These regime inferences are incorporated into the Black-Litterman framework to dynamically adjust allocations among indices.
result The constructed multi-factor portfolio significantly improves the information ratio (IR) relative to the market, raising it from 0.05 to approximately 0.4.

PCGS-TF uses a Transformer to adaptively control expert switching in non-stationary environments.

problem Static regret is insufficient for strictly online prediction in non-stationary settings.
method Policy-Controlled Generalized Share (PCGS) with a Transformer as an update controller.
result PCGS-TF achieves the lowest dynamic regret in non-stationary families and expert pools.

ADVISOR dynamically balances imitation and reinforcement learning to overcome the imitation gap.

problem The gap between imitation learning and reinforcement learning when teaching agents have privileged information.
method Adaptive Insubordination (ADVISOR) dynamically weights imitation and reward-based reinforcement learning losses.
result On-the-fly switching with ADVISOR outperforms pure imitation, pure reinforcement learning, and their combinations.

Markovian RNN adapts to nonstationary data using HMM for better time series prediction.

problem Nonstationary sequential data in real-life applications.
method Markovian RNN with HMM for regime switching and end-to-end optimization.
result Significant performance gains over vanilla RNN and Markov Switching ARIMA.

Develops a new model to better predict corporate bond yields.

problem Persistent shifts in interest rates undermine single-regime models.
method Regime-switching generalized CIR model with two-state short-rate process and credit factors.
result The model improves joint curve fit and delivers interpretable probabilities.

Adaptive beamforming collapses in highly non-stationary environments, but the Universal Switching Beamformer resolves this by dynamically adjusting memory length.

problem Adaptive beamforming performance degrades in highly non-stationary environments.
method Integrating sequential prediction into the beamforming architecture.
result The USB achieves agility and precision in tracking highly non-stationary scenes.

New algorithm minimizes cumulative loss in dynamic linear bandits without prior knowledge of comparator switches.

problem Minimizing cumulative loss in dynamic linear bandits with unknown number of switches.
method Combining several bandit algorithms to adapt to unknown number of switches without prior knowledge.
result First algorithm achieving optimal regret guarantee of O(d(1+ST)T)\mathcal{O}\big(\sqrt{d(1+S_T) T}\big) up to poly-logarithmic terms.

This paper tackles near-optimal adversarial RL with switching costs, providing algorithms and matching lower bounds.

problem Adversarial RL with switching costs, where loss distribution can be non-stationary or adversarial.
method Developed novel switching-reduced algorithms with matching lower bounds for known and unknown transition functions.
result Achieved near-optimal performance in adversarial RL with switching costs, matching theoretical lower bounds.

Framework models multiscale dynamics with Bayesian learning for regime changes.

problem Analyzing complex interactions between fast and slow processes.
method Hierarchical state-space modeling with Sequential Monte Carlo.
result Bayesian approach accurately tracks state transitions and identifies switching dynamics.

Study optimal investment and reinsurance for insurance companies in a dynamic market model.

problem Optimal investment and reinsurance strategies for insurance companies in a regime-switching market model.
method Forward dynamic exponential utility, value function construction, proportional reinsurance optimization.
result Characterization of optimal investment strategy and proportional reinsurance level.

Two algorithms achieve optimal regret with limited adaptivity in multinomial logistic bandits.

problem Achieving optimal regret with limited adaptivity in multinomial logistic bandits.
method Presented two algorithms, B-MNL-CB and RS-MNL, for batched and rarely-switching paradigms.
result Achieved ildeO(T) ilde{O}(\sqrt{T}) regret with limited adaptivity.

New method identifies nonstationary causal structures in time series data.

problem Identifying causal relationships in time series data that change over time.
method High-order Markov Switching Models for regime-dependent causal discovery.
result Scalable approach for estimating high-order regime-dependent causal structures.

Enhances image quality to improve test-time adaptation accuracy.

problem Reducing accuracy loss due to distribution shift in deep networks.
method Integrates image enhancement with TTA methods to reduce prediction uncertainty.
result TECA method increases accuracy of TTA methods without hyperparameters.

We study the adversarial multi-armed bandit problem where partial observations are available and where, in addition to the loss incurred for each action, a \emph{switching cost} is incurred for shifting to a new action. All previously known results incur a factor proportional to the independence number of the feedback …

2019-07-29abs ↗pdf ↗

Robots' agility in changing terrain helps financial models adapt to market shifts.

problem Challenges in financial market forecasting due to regime switching.
method Adapts pretrained LLMs using intrinsic market rewards and reinforcement learning.
result Significantly improved accuracy in adapting to market regime shifts.

Multilayer switch networks are proposed as artificial generators of high-dimensional discrete data (e.g., binary vectors, categorical data, natural language, network log files, and discrete-valued time series). Unlike deconvolution networks which generate continuous-valued data and which consist of upsampling filters a…

2019-03-14abs ↗pdf ↗

We link disjoint longitudinal data for rare disease patients using latent representations and mixed-effects regression.

problem Analyzing treatment switches in rare diseases with limited data and changing measurement instruments.
method We embed item values into a shared latent space using variational autoencoders and apply mixed-effects regression to quantify treatment effects.
result Our approach allows for statistical inference and quantifies the impact of treatment switches in spinal muscular atrophy.

This paper considers the problem of consumption and investment in a financial market within a continuous time stochastic economy. The investor exhibits a change in the discount rate. The investment opportunities are a stock and a riskless account. The market coefficients and discount factor switch according to a finite…

2013-03-06abs ↗pdf ↗

In the present paper, we studied a Dynamic Stochastic Block Model (DSBM) under the assumptions that the connection probabilities, as functions of time, are smooth and that at most ss nodes can switch their class memberships between two consecutive time points. We estimate the edge probability tensor by a kernel-type p…

2017-05-02abs ↗pdf ↗

New method solves complex financial option pricing with varying time steps.

problem Pricing American options with varying time steps and regime switching.
method Explicit Runge-Kutta-Fehlberg scheme with fourth-order compact finite difference in space and high order analytical approximation.
result The method provides better performance in terms of computational speed and accuracy.