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

Trend · papers per month

113225338450 · Jun 202019922001200920172026
48 results for slowly varying parameters

Predicting unobserved bifurcations in time series with unsupervised parameter extraction.

problem Predicting system behavior with unknown parameters from time series data.
method Reservoir computing framework for unsupervised extraction of slowly varying system parameters.
result Model predicts unknown bifurcations not present in training data.

New algorithm for non-stationary bandits with slow drifts.

problem Minimizing dynamic regret in non-stationary bandits with slowly varying rewards.
method Extends Successive Elimination to non-stationary bandits with a novel gap profile characterization.
result First instance-dependent regret upper bound for slowly varying non-stationary bandits.

We study the non-stationary stochastic multiarmed bandit (MAB) problem and propose two generic algorithms, namely, the limited memory deterministic sequencing of exploration and exploitation (LM-DSEE) and the Sliding-Window Upper Confidence Bound# (SW-UCB#). We rigorously analyze these algorithms in abruptly-changing a…

2018-02-23abs ↗pdf ↗

A new framework for sparse regression models with slow variations.

problem Parameter estimation for sparse regression models with slow variations.
method Formulated as a mixed-integer optimization problem, then reformulated as a binary convex optimization problem with a novel relaxation technique.
result Efficiently solves the problem to provable optimality using a cutting plane-type algorithm.

New method infers causal relationships from nonstationary time series data.

problem Challenges in inferring causal relationships from nonstationary time series data.
method Proposes a new class of restricted SCM with time-varying filters and stationary noise, leveraging asymmetry from nonstationarity.
result Demonstrates effectiveness of the proposed methodology on various synthetic and real datasets.

Slow feature analysis (SFA) is a method for extracting slowly varying features from a quickly varying multidimensional signal. An open source Matlab-implementation sfa-tk makes SFA easily useable. We show here that under certain circumstances, namely when the covariance matrix of the nonlinearly expanded data does not …

2009-12-06abs ↗pdf ↗

We consider a variant of the classic multi-armed bandit problem where the expected reward of each arm is a function of an unknown parameter. The arms are divided into different groups, each of which has a common parameter. Therefore, when the player selects an arm at each time slot, information of other arms in the sam…

2018-02-22abs ↗pdf ↗

We study the asymptotic growth of the eigenvalues of the Laplace-Beltrami operator on singular Riemannian manifolds, where all geometrical invariants appearing in classical spectral asymptotics are unbounded, and the total volume can be infinite. Under suitable assumptions on the curvature blow-up, we show how the sing…

2019-03-13abs ↗pdf ↗

We consider a stochastic linear bandit model in which the available actions correspond to arbitrary context vectors whose associated rewards follow a non-stationary linear regression model. In this setting, the unknown regression parameter is allowed to vary in time. To address this problem, we propose D-LinUCB, a nove…

2019-09-19abs ↗pdf ↗

Given nn samples from a population of individuals belonging to different types with unknown proportions, how do we estimate the probability of discovering a new type at the (n+1)(n+1)-th draw? This is a classical problem in statistics, commonly referred to as the missing mass estimation problem. Recent results by Ohannes…

2018-06-25abs ↗pdf ↗

The study shows how geometric Weyl bulk-density exponent rigidifies spectral encodings in O-regularly varying classes.

problem Understanding spectral encodings under Weyl growth conditions.
method Analyzing geometric Weyl bulk-density exponent and proving spectral rigidity.
result The geometric Weyl bulk-density exponent (d2)/2(d-2)/2 rigidifies spectral encodings in the O-regularly varying class, leading to unique admissible exponents and scaling laws.

Paper develops methods for statistical inference in SGD with infinite variance.

problem Challenges in statistical inference for SGD with infinite variance.
method Model-agnostic methodology based on weak convergence and subsampling calibration.
result Asymptotically valid confidence regions for SGD in both finite and infinite variance regimes.

Many recently trained neural networks employ large numbers of parameters to achieve good performance. One may intuitively use the number of parameters required as a rough gauge of the difficulty of a problem. But how accurate are such notions? How many parameters are really needed? In this paper we attempt to answer th…

2018-04-24abs ↗pdf ↗

Study on slow convergence in geometric variational problems.

problem Slow convergence of solutions in geometric variational problems.
method Identifying necessary conditions for slowly converging solutions and characterizing their convergence rate and direction.
result Characterization of the rate and direction of convergence for slowly converging solutions.

In this paper, we propose the uncertain volatility models with stochastic bounds. Like the regular uncertain volatility models, we know only that the true model lies in a family of progressively measurable and bounded processes, but instead of using two deterministic bounds, the uncertain volatility fluctuates between …

2017-02-16abs ↗pdf ↗

Effective risk control must make a tradeoff between the microprudential risk of exogenous shocks to individual institutions and the macroprudential risks caused by their systemic interactions. We investigate a simple dynamical model for understanding this tradeoff, consisting of a bank with a leverage target and an unl…

2015-07-15abs ↗pdf ↗

Unitary recurrent neural networks (URNNs) have been proposed as a method to overcome the vanishing and exploding gradient problem in modeling data with long-term dependencies. A basic question is how restrictive is the unitary constraint on the possible input-output mappings of such a network? This work shows that for …

2019-10-30abs ↗pdf ↗

In this paper we will try to assess the multifractality displayed by the high-frequency returns of Madrid's Stock Exchange IBEX35 index. A Multifractal Detrended Fluctuation Analysis shows that this index has a wide singularity spectrum which is most likely caused by its long memory. Our findings also show that this lo…

2013-06-03abs ↗pdf ↗

In this paper we provide a comprehensive analysis of a structural model for the dynamics of prices of assets traded in a market originally proposed in [1]. The model takes the form of an interacting generalization of the geometric Brownian motion model. It is formally equivalent to a model describing the stochastic dyn…

2017-09-29abs ↗pdf ↗

Time-varying parameters are shown to be ridge regressions, simplifying computations and tuning.

problem Capturing structural change in economic data.
method Ridge regression approach, including cross-validation for tuning, and extensions for sparsity and reduced-rank restrictions.
result The method efficiently estimates large numbers of time-varying parameters, demonstrated with Canadian monetary policy data.

Recent empirical studies suggest that the volatility of an underlying price process may have correlations that decay slowly under certain market conditions. In this paper, the volatility is modeled as a stationary process with long-range correlation properties in order to capture such a situation, and we consider Europ…

2016-04-01abs ↗pdf ↗

Bayesian method for dynamic correlation matrices improves accuracy and responsiveness.

problem Challenges in estimating time-varying correlation matrices, including slow adaptation, insufficient regularization, and diffuse uncertainty.
method Low-rank factor representation with dynamic shrinkage prior and multivariate factor stochastic volatility model.
result Improved accuracy and responsiveness compared to competing methods in various challenging scenarios.

Rough stochastic volatility models have attracted a lot of attentions recently, in particular for the linear option pricing problem. In this paper, starting with power utilities, we propose to use a martingale distortion representation of the optimal value function for the nonlinear asset allocation problem in a (non-M…

2017-03-20abs ↗pdf ↗

Let M be a closed orientable 3-manifold with a negatively curved Riemannian metric. Let {M_i} be a collection of finite regular covers with degree d_i. (1) If the Heegaard genus of M_i grows more slowly than the square root of d_i, then M_i has positive first Betti number for all sufficiently large i. (2) The strong He…

2002-10-21abs ↗pdf ↗

A new method estimates time-varying parameters in earth system models using offline and online data assimilation.

problem Estimating time-varying parameters in complex earth system models.
method Hybrid Offline Online Parameter Estimation with Particle Filtering (HOOPE-PF)
result HOOPE-PF outperforms existing methods, especially with small ensemble sizes.

Paper efficiently infers differential parameters in time-varying models using time score matching.

problem Efficiently inferring differential parameters in time-varying probabilistic models.
method Directly estimates the differential parameter using time score matching and proves consistency of the method.
result Consistent estimation of parameter derivatives in high-dimensional settings.

Generates coherent 3D scenes from monocular videos without supervision.

problem Lack of 3D scene modeling in video generation models.
method Trains a model to generate 3D scenes with moving objects and a background from monocular videos.
result Trained model generates coherent 3D scenes with multiple moving objects and a background.

Latent Noise Injection improves synthetic data generation for privacy and statistical alignment.

problem Slow convergence of generative models in high-dimensional settings.
method Latent Noise Injection using Masked Autoregressive Flows (MAF).
result Synthetic data closely reflects the underlying distribution, especially in high-dimensional settings.

We consider the scenario where the parameters of a probabilistic model are expected to vary over time. We construct a novel prior distribution that promotes sparsity and adapts the strength of correlation between parameters at successive timesteps, based on the data. We derive approximate variational inference procedur…

2013-10-09abs ↗pdf ↗