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,694 papers · 148 categories

Trend · papers per month

5101520 · Nov 201919922001200920172026
48 results for rail switch

We work on the notions of rail arcs and rail isotopy in R3\mathbb{R}^3, and we introduce the notions of rail knotoid diagrams and their equivalence. Our main result is that two rail arcs in R3\mathbb{R}^3 are rail isotopic if and only if their knotoid diagram projections onto the plane of the two lines which we call ra…

2018-12-22abs ↗pdf ↗

Data integration methods that analyze multiple sources of data simultaneously can often provide more holistic insights than can separate inquiries of each data source. Motivated by the advantages of data integration in the era of "big data", we investigate feature selection for high-dimensional multi-view data with mix…

2019-03-27abs ↗pdf ↗

HSR reduces analyst earnings forecast errors by lowering travel friction.

problem How HSR connectivity affects analyst earnings forecast errors in China.
method Firm-year panel data from 2008-2019; placebo test to rule out pre-existing trends.
result HSR reduces analyst earnings forecast errors after connectivity, not before.

Because of the prominent position of urban rail in reducing urban transport-related problems, such as congestion and air pollution, insights into the costs of possible new urban rail projects is very relevant for those involved with cost estimations, policy makers, cost-benefit analysts, and other target groups. Knowle…

2013-03-20abs ↗pdf ↗

Survival strategy for crypto firms in bear markets using BTC-to-sats payments rail.

problem Downside risk in crypto reserves during bear markets.
method Conservative treasury policy, operating line monetizing holdings, BTC-to-sats payments rail.
result Sustained mNAV premium through cycles with disclosed KPIs.

New neural network enforces mass conservation for better ice flow predictions.

problem Reliably project future sea level rise by improving ice sheet model inputs.
method Proposes divergence-free neural networks (dfNNs) enforcing local mass conservation.
result dfNNs yield more reliable ice flux estimates compared to other models.

GeMA learns latent manifolds to benchmark complex systems.

problem Benchmarking complex systems like rail networks and economies with classical methods.
method Geometric Manifold Analysis (GeMA) using a productivity-manifold variational autoencoder (ProMan-VAE).
result GeMA provides more nuanced efficiency evaluations in complex systems.

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 …

2016-08-22abs ↗pdf ↗

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…

2014-11-17abs ↗pdf ↗

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 …

2019-03-25abs ↗pdf ↗

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 …

2019-10-16abs ↗pdf ↗

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.

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.

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.

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.

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)$.

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.

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.

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.

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…

2003-08-20abs ↗pdf ↗

Regime switching volatility models provide a tractable method of modelling stochastic volatility. Currently the most popular method of regime switching calibration is the Hamilton filter. We propose using the Baum-Welch algorithm, an established technique from Engineering, to calibrate regime switching models instead. …

2009-04-09abs ↗pdf ↗

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.

LaMBO optimizes modular systems with switching costs, achieving better results than existing methods.

problem Optimizing systems with costly variable updates in a sequence of modules.
method Lazy Modular Bayesian Optimization (LaMBO) that minimizes switching costs.
result LaMBO achieves vanishing regret and improves over existing cost-aware Bayesian optimization algorithms.