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

171342512683 · Jun 202019922001200920172026
48 results for stable linear systems

The OLS estimator optimally identifies stable linear systems with a finite number of samples.

problem Identifying stable linear systems with a finite number of samples.
method Finite-time analysis of the Ordinary Least Squares (OLS) estimator for stable linear systems.
result The OLS estimator achieves optimal sample complexity for stable systems, matching existing lower bounds up to universal factors.

Study learns dynamics of linear systems from multiple short trajectories.

problem Learning dynamics of autonomous linear systems from multiple short trajectories.
method Finite sample analysis for stable and unstable systems, adjusting trajectory length for marginally stable systems.
result Learning rate of O(1N)\mathcal{O}(\frac{1}{\sqrt{N}}) for both stable and unstable systems.

New algorithm learns stable LDSs with lower error and better control performance.

problem Learning stable LDSs from data with minimal reconstruction error and stability constraints.
method Proposes an optimization method using a recent characterization of stable matrices, iteratively improving reconstruction error and ensuring stability.
result Achieves orders-of-magnitude improvement in reconstruction error compared to existing methods.

We consider the problem of online prediction in a marginally stable linear dynamical system subject to bounded adversarial or (non-isotropic) stochastic perturbations. This poses two challenges. Firstly, the system is in general unidentifiable, so recent and classical results on parameter recovery do not apply. Secondl…

2020-02-06abs ↗pdf ↗

Study non-asymptotic bounds on correlation in high-dimensional linear systems, revealing invariant subspaces and bottlenecks.

problem Understanding correlation and mixing in high-dimensional linear systems with Gaussian noise.
method Sampling from sub-trajectories, using Talagrand's inequality, and analyzing invariant subspaces.
result Large discrepancy between algebraic and geometric multiplicity leads to bottlenecks between invariant subspaces.

Regularized least-squares approaches have been successfully applied to linear system identification. Recent approaches use quadratic penalty terms on the unknown impulse response defined by stable spline kernels, which control model space complexity by leveraging regularity and bounded-input bounded-output stability. T…

2013-09-30abs ↗pdf ↗

Regularized approaches have been successfully applied to linear system identification in recent years. Many of them model unknown impulse responses exploiting the so called Reproducing Kernel Hilbert spaces (RKHSs) that enjoy the notable property of being in one-to-one correspondence with the class of positive semidefi…

2019-09-05abs ↗pdf ↗

This paper proposes a new approach to describe the stability of linear time-invariant systems via the torsion τ(t)τ(t) of the state trajectory. For a system r˙(t)=Ar(t)\dot{r}(t)=Ar(t) where AA is invertible, we show that (1) if there exists a measurable set E1E_1 with positive Lebesgue measure, such that r(0)E1r(0)\in E_1 implies t…

2020-01-03abs ↗pdf ↗

The paper tackles long-context linear system identification with improved sample complexity bounds.

problem Identifying dynamical systems with long dependencies over fixed context windows.
method Established sample complexity bounds for systems with linear dependencies over a context window of length p.
result The learning process is not hindered by slow mixing properties in extended context windows.

We study the problem of controlling linear time-invariant systems with known noisy dynamics and adversarially chosen quadratic losses. We present the first efficient online learning algorithms in this setting that guarantee O(T)O(\sqrt{T}) regret under mild assumptions, where TT is the time horizon. Our algorithms rely …

2018-06-19abs ↗pdf ↗

Bayesian regularization tackles collinearity in large-scale systems with correlated inputs.

problem Collinearity in large-scale linear systems identification due to correlated inputs.
method Bayesian regularization with stable spline covariance and Markov chain Monte Carlo scheme.
result Efficient reconstruction of impulse responses with high correlation among inputs.

Estimates multiple linear systems on a graph with smoothness constraints.

problem Joint estimation of multiple linear systems under graph smoothness constraints.
method Proposes estimators for joint estimation of system matrices with error bounds.
result MSE converges to zero as mm increases, typically polynomially fast w.r.t mm.

Improves numerical solution of ill-conditioned linear systems for machine learning.

problem Wastefulness and instability in solving ill-conditioned linear systems.
method autonugget combines Richardson extrapolation to determine the solution of the ill-conditioned system, improving accuracy over a single nugget.
result Improves accuracy of numerical solution of ill-conditioned linear systems.

New insights into spectral statistics of sample covariance matrix for stable linear systems.

problem Estimating high-dimensional stable state transition matrices from noisy data.
method Combining spectral theorem for non-Hermitian operators, concentration of measure, and perturbation theory.
result The spectral radius of the sample covariance matrix exhibits phase transitions in high dimensions.

The paper develops a convex parameterization for robust RNNs ensuring stability and robustness.

problem Lack of stability and robustness guarantees in RNNs for sequence-to-sequence mapping applications.
method Formulated convex sets of RNNs with stability and robustness guarantees using incremental quadratic constraints.
result The proposed model structure ensures global exponential stability and bounds on incremental 2 \ell_2 gain.

Classifies non-linear Fredholm maps linking to stable homotopy groups of spheres.

problem Classifying non-linear proper Fredholm maps between Hilbert spaces.
method Using stable homotopy groups of spheres to classify maps up to proper homotopy.
result Determines the non-trivial kernel of the map from stable homotopy groups to non-linear proper Fredholm maps.

This paper improves system identification by reducing sample complexity for high-dimensional linear dynamical systems.

problem High sample complexity for learning partially observed linear dynamical systems in high dimensions.
method Introduces an 1\ell_1-regularized estimation method that reduces sample complexity from linear to logarithmic with system dimension.
result Markov parameters can be learned with logarithmic number of samples relative to system dimension, improving sample complexity.

In this paper we provide some stability criteria for systems of linear subspaces of VWV \otimes W and for systems of quotient coherent sheaves, using, respectively, the Hilbert-Mumford numerical criterion and moment map. Along the way, we generalize the Gelfand-MacPherson correspondence [11] from point sets to sets of …

2004-01-20abs ↗pdf ↗

Paper tackles SMPC for linear systems with unknown noise distribution.

problem Stochastic MPC for linear systems with chance state constraints and unknown noise distribution.
method Reformulate chance constraints, design robust benchmark SMPC, and develop adaptive SMPC with online noise statistics learning.
result Adaptive SMPC guarantees time-uniform satisfaction of unknown reformulated state constraints with high probability.

Research on long-range memory in financial and social systems using various models.

problem Understanding the nature of long-range memory in socioeconomic systems.
method Various Markov processes including point processes, stochastic differential equations, and agent-based models.
result New estimators of self-similarity and long-range memory for non-Gaussian systems are needed.

For dynamical systems that can be modelled as asymptotically stable linear systems forced by Gaussian noise, this paper develops methods to infer or estimate their modes from observations in real time. The modes can be real or complex. For a real mode, we wish to infer its damping rate and mode shape. For a complex mod…

2019-09-23abs ↗pdf ↗

An estimate on the number of distinct relative periodic orbits around a stable relative equilibrium in a Hamiltonian system with continuous symmetry is given. This result constitutes a generalization to the Hamiltonian symmetric framework of a classical result by Weinstein and Moser on the existence of periodic orbits …

2000-07-13abs ↗pdf ↗

Study of deep Stable neural networks with various activation functions.

problem Characterizing the infinitely wide limits of deep Stable neural networks.
method Investigation of large-width properties of deep Stable NNs with a generalized central limit theorem for heavy tails.
result Extension of characterization to a broader class of activation functions, including sub-linear, asymptotically linear, and super-linear functions.

Noise can stabilize systemic risk models with uncertain robustness.

problem Understanding systemic risk in financial systems with uncertain parameters.
method Analyzing a mean-field model of systemic risk with uncertain coefficients and noise.
result Noise can induce stability in systemic risk models, contrary to intuition.

Efficient algorithm predicts unknown linear systems with long-term memory.

problem Predicting unknown and partially observed linear dynamical systems with long-term memory.
method Bounding the generalized Kolmogorov width of the Kalman filter model using spectral methods and conducting tight convex relaxation.
result Competes with Kalman filter in hindsight with only logarithmic regret.

This paper studies when particle filtering is efficient for planning in partially observed systems.

problem The efficiency of particle filtering for planning in partially observed linear dynamical systems.
method Coupling of ideal and approximate sequences to bound particle complexity.
result Polynomially many particles suffice for stable systems to approximate optimal planning.

Study on stable torsion length in groups, showing it vanishes in crystallographic groups and providing algorithms for computation.

problem Understanding the stable torsion length in groups, especially in crystallographic and free products of groups.
method Developed linear programming and exact algorithms to compute stable torsion length in free products of groups and finite groups.
result Showed that stable torsion length vanishes in crystallographic groups and provided exact computations for nontrivial examples.

New bounds quantify estimation error in kernel-based system identification with unknown hyperparameters.

problem Inaccurate error bounds for kernel-based system identification with unknown hyperparameters.
method Construct a high-probability set for true hyperparameters from marginal likelihood, then find worst-case posterior covariance.
result Proposed bounds contain true model with high probability and verified in simulations.

In this paper we introduce a novel method for linear system identification with quantized output data. We model the impulse response as a zero-mean Gaussian process whose covariance (kernel) is given by the recently proposed stable spline kernel, which encodes information on regularity and exponential stability. This s…

2015-04-26abs ↗pdf ↗

Study identifies stable configurations of intertwined threads with repulsive interactions.

problem Stable configurations of entangled systems with repulsive interactions.
method Analysis of steepest descent flow of an energy functional.
result Existence and uniqueness of stable configuration of two layers drifting apart at t1/3t^{1/3} rate.
A Creepy Worldphysics.soc-ph

Using the mechanics of creep in material sciences as a metaphor, we present a general framework to understand the evolution of financial, economic and social systems and to construct scenarios for the future. In a nutshell, highly non-linear out-of-equilibrium systems subjected to exogenous perturbations tend to exhibi…

2014-01-14abs ↗pdf ↗

The paper proves stability of certain singularities in integrable systems.

problem Stability of singularities in integrable systems under perturbations.
method Analytic and smooth perturbations of completely integrable systems, connectedness condition.
result Non-degenerate singular fibers are structurally stable under small perturbations.