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

Trend · papers per month

72144216288 · Jun 202019922001200920172026
48 results for Fixed-time convergence

New method accelerates optimization in fixed time, improving convergence rates.

problem Optimization in large-scale data-driven problems.
method Gradient-based optimization framework with fixed-time stable dynamical systems.
result Achieves convergence to the optimizer in a fixed number of iterations, independent of initialization.

GenFlow optimizes faster, avoiding saddle points in fixed time.

problem Designing efficient optimization algorithms for convex and non-convex functions.
method Introduces GenFlow and momentum variants with fixed-time convergence guarantees.
result GenFlow and momentum variants converge to optimal solutions in fixed time for PL functions and evade saddle points uniformly.

Granger causality is a fundamental technique for causal inference in time series data, commonly used in the social and biological sciences. Typical operationalizations of Granger causality make a strong assumption that every time point of the effect time series is influenced by a combination of other time series with a…

2019-12-18abs ↗pdf ↗

Recent work on Bayesian optimization has shown its effectiveness in global optimization of difficult black-box objective functions. Many real-world optimization problems of interest also have constraints which are unknown a priori. In this paper, we study Bayesian optimization for constrained problems in the general ca…

2014-03-22abs ↗pdf ↗

New scalable MARL framework for dynamic networked systems.

problem Scalability in multi-agent reinforcement learning with dynamic dependencies.
method Scalable Actor Critic framework for non-local and stochastic dependencies.
result Finite-time error bound showing convergence rate dependence on information spread speed.

We describe a Markov latent state space (MLSS) model, where the latent state distribution is a decaying mixture over multiple past states. We present a simple sampling algorithm that allows to approximate such high-order MLSS with fixed time and memory costs.

2017-11-08abs ↗pdf ↗

In this paper, we establish a framework for the analysis of linear parabolic equations on conical surfaces and use them to study the conical Ricci flow. In particular, we prove the long time existence of the conical Ricci flow for general cone angle and show that this solution has the optimal regularity, namely, the ti…

2016-05-28abs ↗pdf ↗

Marginal Structural Models (MSM) are the most popular models for causal inference from time-series observational data. However, they have two main drawbacks: (a) they do not capture subject heterogeneity, and (b) they only consider fixed time intervals and do not scale gracefully with longer intervals. In this work, we…

2019-02-12abs ↗pdf ↗

A coordinate-free proof of the Maximum Principle is provided in the specific case of an optimal control problem with fixed time. Our treatment heavily relies on a special notion of variation of curves that consist of a concatenation of integral curves of time-dependent vector fields with unit time component, and on the…

2002-12-04abs ↗pdf ↗

In this paper we study the Teichmüller harmonic map flow as introduced by Rupflin and Topping [15]. It evolves pairs of maps and metrics (u,g)(u,g) into branched minimal immersions, or equivalently into weakly conformal harmonic maps, where uu maps from a fixed closed surface MM with metric gg to a general target manif…

2017-11-24abs ↗pdf ↗

We study a specific \textit{combinatorial pure exploration stochastic bandit problem} where the learner aims at finding the set of arms whose means are above a given threshold, up to a given precision, and \textit{for a fixed time horizon}. We propose a parameter-free algorithm based on an original heuristic, and prove…

2016-05-27abs ↗pdf ↗

Study geometric flows with varying parameters and prove continuous dependence.

problem Continuous dependence of flows on parameters in geometric settings.
method Derived suitable topologies for vector fields and flows, proved new continuous dependence.
result Proved continuous dependence of flows on parameters in a general topological space.

Anytime MiniBatch speeds up online distributed optimization by handling slow nodes.

problem Mitigating the impact of slow nodes (stragglers) in distributed optimization.
method Proposes an online distributed optimization method that averages minibatch gradients via consensus rounds.
result Prevents stragglers from slowing progress without wasting work.

We introduce a simple approach for testing the reliability of homogeneous generators and the Markov property of the stochastic processes underlying empirical time series of credit ratings. We analyze open access data provided by Moody's and show that the validity of these assumptions - existence of a homogeneous genera…

2014-03-31abs ↗pdf ↗

We study quaternionic stochastic areas processes associated with Brownian motions on the quaternionic rank-one symmetric spaces HHn\mathbb{H}H^n and HPn\mathbb{H}P^n. The characteristic functions of fixed-time marginals of these processes are computed and allows for the explicit description of their corresponding large-t…

2019-03-02abs ↗pdf ↗

A pairs trading model with time-varying volatility using stochastic control.

problem Optimizing pairs trading strategies with fluctuating asset volatilities.
method Stochastic control techniques, Finite Difference method, Generalized Method of Moments.
result Optimal trading strategies maximizing expected power utility from terminal wealth.

Estimates drift functions in SDEs using denoising diffusion models.

problem Estimating time-homogeneous drift functions in multivariate SDEs.
method Formulates drift estimation as a denoising problem, trains a conditional diffusion model.
result Proposed estimator matches classical methods in low dimensions and remains competitive in higher dimensions.

Models for sequential data such as the recurrent neural network (RNN) often implicitly model a sequence as having a fixed time interval between observations and do not account for group-level effects when multiple sequences are observed. We propose a model for grouped sequential data based on the RNN that accounts for …

2018-12-23abs ↗pdf ↗

Given discrete time observations over a fixed time interval, we study a nonparametric Bayesian approach to estimation of the volatility coefficient of a stochastic differential equation. We postulate a histogram-type prior on the volatility with piecewise constant realisations on bins forming a partition of the time in…

2018-01-30abs ↗pdf ↗

The paper develops deep learning models for personalized treatment rules in survival analysis.

problem Deriving optimal treatment rules for bivariate survival outcomes in randomized trials.
method Adaptive prediction-powered learning using deep neural networks and stochastic policies.
result Maximizes joint survival probability beyond fixed time points (t1,t2)(t_1, t_2).

Kernel Induced Random Survival Forests (KIRSF) is a statistical learning algorithm which aims to improve prediction accuracy for survival data. As in Random Survival Forests (RSF), Cumulative Hazard Function is predicted for each individual in the test set. Prediction error is estimated using Harrell's concordance inde…

2010-08-24abs ↗pdf ↗

We propose a framework to study the optimal liquidation strategy in a limit order book for large-tick stocks, with spread equal to one tick. All order book events (market orders, limit orders and cancellations) occur according to independent Poisson processes, with parameters depending on price move directions. Our goa…

2017-01-05abs ↗pdf ↗

The Trouvé group GA\mathcal G_{\mathcal A} from image analysis consists of the flows at a fixed time of all time-dependent vectors fields of a given regularity A(Rd,Rd)\mathcal A(\mathbb R^d,\mathbb R^d). For a multitude of regularity classes A\mathcal A, we prove that the Trouvé group GA\mathcal G_{\mathcal A} coincides wi…

2017-11-03abs ↗pdf ↗

New method predicts spatio-temporal data with short and long-range dependence.

problem Uncertainty in predicting the distribution of mixed moving average fields.
method Theory-guided machine learning approach using generalized Bayesian algorithm.
result Fixed-time and any-time PAC Bayesian bounds for ensemble forecasts.

Study optimal portfolios in a non-Markovian regime-switching model with random time horizon.

problem Optimal portfolio selection in a market with non-Markovian regime-switching and random time horizon.
method Formulated as a constrained stochastic linear-quadratic optimal control problem, derived closed-form expressions for optimal portfolios and efficient frontier.
result Closed-form expressions for optimal portfolios and efficient frontier derived under non-Markovian regime-switching and random time horizon.

The influence of Commodity Trading Advisors (CTA) on the price process is explored with the help of a simple model. CTA managers are taken to be Kelly optimisers, which invest a fixed proportion of their assets in the risky asset and the remainder in a riskless asset. This requires regular adjustment of the portfolio w…

2016-10-31abs ↗pdf ↗

Study local expansions of continuous-time processes using Ito signature properties.

problem Analyzing local expansions of continuous-time processes and their moments.
method Using the Ito signature, a basis of iterated integrals, to conduct expansions of the process' characteristic function.
result Explicit coefficients and stochastic representations for asymptotics as time shrinks or diverges.

We consider the optimal stopping problem $v^{(\eps)}:=\sup_{τ\in\mathcal{T}_{0,T}}\mathbb{E}B_{(τ-\eps)^+}$ posed by Shiryaev at the International Conference on Advanced Stochastic Optimization Problems organized by the Steklov Institute of Mathematics in September 2012. Here T>0T>0 is a fixed time horizon, $(B_t)_{0\le…

2013-01-14abs ↗pdf ↗

Continuous time Bayesian networks (CTBNs) describe structured stochastic processes with finitely many states that evolve over continuous time. A CTBN is a directed (possibly cyclic) dependency graph over a set of variables, each of which represents a finite state continuous time Markov process whose transition model is…

2012-10-19abs ↗pdf ↗

Paper presents robust confidence sequences for means with known moment bounds and arbitrary corruption.

problem Tackles robustness to outliers and adversarial corruptions in mean estimation.
method Designs new robust exponential supermartingales to create confidence sequences.
result Achieves optimal width and shows smaller margin of error compared to fixed-time robust methods.

Optimizes trading large volumes of volatile assets with fast mean-reverting volatility.

problem Challenges of executing large volumes of illiquid or volatile assets.
method Modeling uncertain volatility and liquidity with fast mean-reverting dynamics, using singular perturbation arguments and high-frequency data.
result Approximately optimal trade execution strategies under fast mean-reversion.