A note on lattice knotsmath.GT
One type of switch simplifies operations on lattice knots.
problem Operations on lattice knots are complex.
method Reduced operations to one type of local switch.
result Simplified set of operations on lattice knots.
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 “local switches”
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 …
Model captures external influences through random parameters and regime switching.
problem Capturing external influences in asset dynamics with uncertainty and regime changes.
method Developed a stochastic model with random parameters and regime switching, mathematically consistent and interpretable.
result Demonstrated the model's versatility through local volatility models and characteristic functions.
Breaks down complex nonlinear dynamics into simpler components.
problem Control of nonlinear dynamical systems remains challenging.
method Inspired by hybrid switching systems, decomposes dynamics into simpler stochastic switching linear dynamical systems.
result Extracts hierarchies of Markovian and auto-regressive locally linear controllers from nonlinear experts.
Training-Time Batch Normalization Reshapes Local Partition Geometry in Piecewise-Affine Networkscs.LG
BN refines local partition geometry in piecewise-affine networks during training.
problem Understanding the effect of BN on the function realized during training in piecewise-affine networks.
method Analyzing the geometry of switching hyperplanes and affine-region partition conditioned on a mini-batch.
result BN increases expected local partition refinement in ReLU and piecewise-affine networks.
Markov regime switching models have been used in numerous empirical studies in economics and finance. However, the asymptotic distribution of the likelihood ratio test statistic for testing the number of regimes in Markov regime switching models has been an unresolved problem. This paper derives the asymptotic distribu…
We derive integral tests for the existence and absence of arbitrage in a financial market with one risky asset which is either modeled as stochastic exponential of an Ito process or a positive diffusion with Markov switching. In particular, we derive conditions for the existence of the minimal martingale measure. We al…
Unified framework detects change-points and estimates parameters in nonlinear systems with regime switching.
problem Detecting change-points and estimating parameters in nonlinear dynamical systems with regime transitions.
method Residual-loss anomaly analysis of physics-informed neural networks, two-stage strategy.
result The method outperforms traditional approaches in change-point localization and parameter estimation accuracy.
Study on stock trading model with uncertain market status, proving free boundaries and optimal strategies.
problem Optimal trading strategies in a stock market with uncertain market status.
method Free boundary problem, variational inequality system, degenerate operator, C^∞-smoothness.
result All four switching free boundaries are no-overlapping, monotonic, and C^∞-smooth, and their relative localities are completely determined.
Efficient method for lookback option pricing under Markov models.
problem Pricing lookback options under Markov models.
method Model-free representations combined with numerical quadrature and Markov chain approximation.
result Efficient method applicable to various Markov models.
Paper tackles non-stationary bandits with various examples.
problem Non-stationary stochastic bandit problem with specific cases.
method Proposes a single algorithm for multiple non-stationary bandit problems.
result Unified solution for four different bandit problems.
FedSGM tackles constrained federated learning with unified framework.
problem Functional constraints, communication bottlenecks, local updates, and partial client participation in federated learning.
method Unified framework based on switching gradient method, incorporating bi-directional error feedback, and soft switching for stability.
result Achieves convergence rate with high-probability bounds decoupling from sampling noise.
This paper studies the bail-out optimal dividend problem with regime switching under the constraint that the cumulative dividend strategy is absolutely continuous. We confirm the optimality of the regime-modulated refraction-reflection strategy when the underlying risk model follows a general spectrally negative Markov…
New algorithm reduces switching costs in multinomial logit bandit problems.
problem Minimizing switching costs in multinomial logit bandit problems.
method Proposed AT-DUCB and FH-DUCB algorithms with low assortment switching costs.
result AT-DUCB and FH-DUCB algorithms achieve almost optimal minimax regret with low switching costs.
In this paper we discuss the optimal liquidation over a finite time horizon until the exit time. The drift and diffusion terms of the asset price are general functions depending on all variables including control and market regime. There is also a local nonlinear transaction cost associated to the liquidation. The mode…
New polynomial invariants derived from birack and switch structures.
problem Polynomial invariants of braids.
method Switch structures, birack colorings, quiver-valued invariants.
result New polynomial invariants of braids.
In the classical model of stock prices which is assumed to be Geometric Brownian motion, the drift and the volatility of the prices are held constant. However, in reality, the volatility does vary. In quantitative finance, the Heston model has been successfully used where the volatility is expressed as a stochastic dif…
In this paper, we study optimal switching problems under ambiguity. To characterize the optimal switching under ambiguity in the finite horizon, we use multidimensional reflected backward stochastic differential equations (multidimensional RBSDEs) and show that a value function of the optimal switching under ambiguity …
In an observed generalized semi-Markov regime, estimation of transition rate of regime switching leads towards calculation of locally risk minimizing option price. Despite the uniform convergence of estimated step function of transition rate, to meet the existence of classical solution of the modified price equation, t…
We develop the first Bayesian Optimization algorithm, BLOSSOM, which selects between multiple alternative acquisition functions and traditional local optimization at each step. This is combined with a novel stopping condition based on expected regret. This pairing allows us to obtain the best characteristics of both lo…
This work extends identifiability analysis to sequential latent variable models, focusing on Switching Dynamical Systems.
problem Identifying latent variables in sequential data models.
method Proved identifiability of Markov Switching Models and established conditions for Switching Dynamical Systems.
result Identifiability of latent variables and non-linear mappings in Switching Dynamical Systems up to affine transformations.
The problem of optimal switching between nonlinear autonomous subsystems is investigated in this study where the objective is not only bringing the states to close to the desired point, but also adjusting the switching pattern, in the sense of penalizing switching occurrences and assigning different preferences to util…
Code-switching, the alternation of languages within a conversation or utterance, is a common communicative phenomenon that occurs in multilingual communities across the world. This survey reviews computational approaches for code-switched Speech and Natural Language Processing. We motivate why processing code-switched …
This paper presents the solution to a European option pricing problem by considering a regime-switching jump diffusion model of the underlying financial asset price dynamics. The regimes are assumed to be the results of an observed pure jump process, driving the values of interest rate and volatility coefficient. The p…
New algorithms improve sampling from complex distributions.
problem Sampling from complex probability distributions efficiently.
method Regime-switching Langevin dynamics and Monte Carlo algorithms.
result Convergence guarantees and iteration complexities provided.
This paper studies pricing derivatives in an age-dependent semi-Markov modulated market. We consider a financial market where the asset price dynamics follow a regime switching geometric Brownian motion model in which the coefficients depend on finitely many age-dependent semi-Markov processes. We further allow the vol…
Squirrel switches between optimizers for better performance.
problem Finding the best optimizer for a given problem.
method Switches between different optimizers based on performance.
result Improves performance on various problems.
Discrete-time weak approximation of a Black-Scholes model with drift and volatility Markov switchingmath.PR
Study approximates financial market with discrete-time models.
problem Approximating continuous-time financial market models with discrete-time.
method Constructs discrete-time market models with Markov switching and proves convergence.
result Discrete-time models converge to continuous-time Black-Scholes model with Markov switching.
This paper studies deep learning methodologies for portfolio optimization in the US equities market. We present a novel residual switching network that can automatically sense changes in market regimes and switch between momentum and reversal predictors accordingly. The residual switching network architecture combines …
Optimizes control of hybrid systems with multiple switching processes.
problem Optimal control of hybrid systems with multiple Markov switching processes.
method Combines two separate Markov chains into one synthetic chain, derives HJB equations, and solves the portfolio choice problem.
result Derives explicit solutions and value functions for the optimal control problem.
Study tackles balancing policy switching costs in offline RL.
problem Balancing the cost of policy switching in offline RL.
method Optimal transport ideas and Net Actor-Critic algorithm.
result Demonstrated efficiency on multiple RL benchmarks.
Novel method recovers market regime changes from option prices.
problem Recovering market regime changes from option prices.
method Assumed Markov regime switching, computed implied volatility, validated recovery of regime changes.
result Implied volatility time series can recover market regime changes.
Unsupervised learning of multiscale switching dynamical system models from multimodal neural datacs.LG
New algorithm learns switching dynamics from multiple neural signals.
problem Learning accurate switching dynamical system models from multimodal neural data.
method Unsupervised learning algorithm for multiscale switching dynamical system models.
result Switching multiscale dynamical system models outperform single-scale models in behavior decoding.
A Problem of Finite-Horizon Optimal Switching and Stochastic Control for Utility Maximizationmath.OC
Paper tackles utility maximization with job-switching and retirement constraints.
problem Maximizing utility with job-switching and retirement constraints.
method Dual-martingale approach and double obstacle problem theory.
result Characterization of optimal job-switching strategy and wealth boundaries.
Solves label switching in mixture models using optimal transport.
problem Label switching in mixture model posterior inference prevents meaningful statistics assessment.
method Proposes an algorithm leveraging optimal transport to compute posterior statistics in a quotient space.
result Demonstrates advantages over alternative approaches on simulated and real data.
Poincaré-Hopf theorem extended to Filippov vector fields on 2D manifolds.
problem Extending Poincaré-Hopf theorem to Filippov vector fields.
method Introducing new index definition for Filippov vector fields, including singularities.
result Established a variant of Hairy Ball Theorem for Filippov vector fields.
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 with switching cost.
The paper explores dynamic regret with switching cost in online decision making.
problem The relation between dynamic regret and switching cost in online decision making.
method Investigates two classic online settings: Online Algorithms (OA) and Online Convex Optimization (OCO). Provides a new theoretical analysis framework.
result The switching cost impacts dynamic regret differently in OA and has no impact in OCO.
Paper presents an efficient algorithm for linear MDP with low switching cost.
problem Large state space reinforcement learning problems with low switching cost.
method First algorithm for linear MDP with low switching cost, achieving near-optimal regret and switching cost.
result Regret bound of $\widetilde{O}\left(\sqrt{d^3H^4K}
ight)$ and near-optimal switching cost of $O\left(d H\log K
ight)$.
This paper studies the impact of limited switches on resource-constrained dynamic pricing with demand learning. We focus on the classical price-based blind network revenue management problem and extend our results to the bandits with knapsacks problem. In both settings, a decision maker faces stochastic and distributio…
Study strategic competition in commodity markets using impulse-switching controls.
problem Strategic competition between upstream and downstream firms in commodity markets.
method Non-zero-sum stochastic differential game with mixed impulse/switching controls.
result Multiple Nash equilibria found, depending on the number of switches by the downstream firm.
Paper analyzes and predicts Covid19 in Romania using neural networks and regime switching.
problem Inaccurate reported numbers and multiple influencing factors in pandemic prediction.
method Three-stage analysis using SIR model refined with neural networks and regime switching.
result Daily estimation of parameters and identification of regime turning points for predictions.
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.
Develops a method to model neural dynamics with flexible yet interpretable latent states.
problem Capturing complex nonlinear dynamics in neural time series while maintaining interpretability.
method Gaussian Process Switching Linear Dynamical System (gpSLDS) that balances expressiveness and interpretability.
result Favorable performance in comparison to rSLDS on synthetic and real neuroscience data.
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.
This paper addresses parameter estimation for wave equations with Markovian switching.
problem Parameter estimation for wave equations with abrupt changes.
method Bayesian statistical framework using discrete sparse Bayesian learning.
result Strong performance in parameter estimation for variable coefficient PDEs.
Algorithm for bandits with switching costs achieves optimal regret bounds.
problem Optimal regret bounds for stochastic and adversarial bandits with switching costs.
method Adaptation of Tsallis-INF algorithm with no prior knowledge of regime or time horizon.
result Achieves minimax optimal regret bounds in various settings.
In this paper, we derive the family switching formula of -n two-sphere fiber bundle embedded in a smooth four-manifold fiber bundle. In the smooth category, it is a partial generalization of Fintushel-Stern's argument for four-manifolds. We also derive an algebraic analogue of the family switching formula, allowing the…