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

1234 · Jun 201919922001200920172026
48 results for time-invariant

Evolution of planar curves under a nonlocal geometric equation is investigated. It models the simultaneous contraction and growth of carbonate particles called ooids in geosciences. Using classical ODE results and a bijective mapping we demonstrate that the steady parameters associated with the physical environment det…

2016-02-20abs ↗pdf ↗

New method learns time-invariant rewards from demonstrations.

problem Learning robust rewards for tasks with varying execution times.
method Model-based inverse reinforcement learning with time-invariant costs.
result Approach enables learning from misaligned demonstrations and generalizes spatially.

A method for learning with autoregressive chain-of-thoughts.

problem Learning prompt-to-answer mappings from sequence-to-next-token generators.
method Iterating a fixed, time-invariant generator for multiple steps to generate a chain-of-thought, then taking the final token as the answer.
result Universal representability and computationally tractable chain-of-thought learning for a simple base class.

We build a simple diagnostic criterion for approximate factor structure in large cross-sectional equity datasets. Given a model for asset returns with observable factors, the criterion checks whether the error terms are weakly cross-sectionally correlated or share at least one unobservable common factor. It only requir…

2016-12-15abs ↗pdf ↗

SPAQL improves RL by adaptively partitioning state-action space and learning a time-invariant policy.

problem Efficient model-free reinforcement learning with scalable algorithms.
method Adaptive Q-learning with UCB and Boltzmann exploration, automatically tuning temperature.
result SPAQL converges faster and uses fewer resources than AQL, showing higher sample efficiency.

The paper tackles joint learning of linear systems, improving accuracy with pooled data.

problem Estimating transition matrices of multiple related linear systems more accurately.
method Developed novel techniques to bound estimation errors and establish high probability bounds for singular values.
result Significant gains in accuracy achieved by pooling data across systems.

Paper tackles temporal overfitting in wind power curve modeling.

problem Temporal overfitting in wind power curve modeling.
method Proposes a Gaussian process-based method to partition and model time-invariant and time-varying components.
result Significant improvement in predicting responses for different time periods.

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 ↗

New model stabilizes asynchronous LTI systems, independent of synchronous stability.

problem Stability of asynchronous LTI systems under randomization and asynchrony.
method Introduced a new model for random asynchronous LTI systems and developed a method for system identification.
result Stability of random asynchronous LTI systems is independent of synchronous stability.

We provide a brief tutorial on the use of concentration inequalities as they apply to system identification of state-space parameters of linear time invariant systems, with a focus on the fully observed setting. We draw upon tools from the theories of large-deviations and self-normalized martingales, and provide both d…

2019-06-27abs ↗pdf ↗

AR model forecasts partially observed dynamical time series by estimating evolution function and imputing missing variables.

problem Forecasting dynamical time series with missing variables.
method Autoregressive with slack time series (ARS) model.
result ARS model forecasts future time series with time-invariant and linear assumptions.

We prove that stochastic gradient descent efficiently converges to the global optimizer of the maximum likelihood objective of an unknown linear time-invariant dynamical system from a sequence of noisy observations generated by the system. Even though the objective function is non-convex, we provide polynomial running …

2016-09-16abs ↗pdf ↗

In this paper we construct the differential equations of the stream lines that characterize plasma regarded as a non-isotropic medium geometrized by a jet rheonomic time-invariant Berwald-Moor metric. Section 1 contains historical notes regarding the Plasma Physics and its geometrical description. Section 2 analyzes th…

2010-05-09abs ↗pdf ↗

New method calibrates asynchronous, error-prone covariates for longitudinal data.

problem Estimation biases and slow convergence in analyzing time-varying covariates with measurement error.
method Functional calibration approach based on functional principal component analysis.
result Asymptotically unbiased and consistent estimators for time-invariant coefficients; optimal convergence rate for time-varying coefficients.

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 ↗

Neural ordinary differential equations (ODEs) have been attracting increasing attention in various research domains recently. There have been some works studying optimization issues and approximation capabilities of neural ODEs, but their robustness is still yet unclear. In this work, we fill this important gap by expl…

2019-10-12abs ↗pdf ↗

We consider the problem of learning a realization for a linear time-invariant (LTI) dynamical system from input/output data. Given a single input/output trajectory, we provide finite time analysis for learning the system's Markov parameters, from which a balanced realization is obtained using the classical Ho-Kalman al…

2018-06-14abs ↗pdf ↗

Study constructs solutions for evolving hypersurfaces using inverse spacetime mean curvature.

problem Evolution of hypersurfaces in spacetime.
method Weak solutions for hypersurfaces evolving along inverse spacetime mean curvature in asymptotically flat maximal initial data sets.
result Weak solution detects both future- and past-trapped apparent horizons.

New measure EC assesses node contributions in nonlinear, time-varying systems.

problem Existing node contribution measures assume linear, time-invariant dynamics, failing for complex, real-world systems.
method Defined 'emergent contribution (EC)' as a dynamical leverage measure from Jacobians of differentiable models.
result EC diverges from average controllability under persistent regime switching and sign reversal, identifying limits of local linearization.

dynoGP uses deep Gaussian processes for dynamic system identification.

problem System identification for complex dynamical systems.
method Interconnecting linear dynamic GPs and static GPs to model dynamic and static nonlinearities.
result Demonstrates effectiveness of the approach using both simulated and real-world data.

Let MmM^m be an oriented manifold, let Nm1N^{m-1} be an oriented closed manifold, and let pp be a point in MmM^m. For a smooth map f:Nm1Mm,p∉Imf,f:N^{m-1} \to M^m, p \not\in Im f, we introduce an invariant awinp(f)awin_p(f) that can be regarded as a generalization of the classical winding number of a planar curve around a point. We show…

2003-01-11abs ↗pdf ↗

The paper proposes a method for interpretable mixture density estimation using a tree structure.

problem Complex probability distributions in machine learning models.
method Interpretable tree structure for mixture density estimation with fast inference.
result The method achieves both high speed and interpretability for mixture density estimation.

Safety filter for unknown discrete-time systems with learned models and noise covariance.

problem Ensuring safety for unknown discrete-time linear systems with Gaussian noise.
method Develops a learning-based safety filter using empirical model and noise covariance, optimizing control actions to stay within safety constraints.
result Minimally modifies nominal control actions to ensure safety with high probability, tightening constraints as more data is collected.

We consider the problem of discrete-time signal denoising, focusing on a specific family of non-linear convolution-type estimators. Each such estimator is associated with a time-invariant filter which is obtained adaptively, by solving a certain convex optimization problem. Adaptive convolution-type estimators were dem…

2018-03-29abs ↗pdf ↗

Iterative method learns unknown constraints for MPC control.

problem Learning to satisfy unknown polyhedral state constraints in iterative MPC.
method Collects and improves estimates of unknown constraints using collected data, designs an MPC controller to satisfy the estimated constraints.
result Robust and probabilistic guarantees of constraint satisfaction as a function of task iterations.

Many real-world applications require robust algorithms to learn point processes based on a type of incomplete data --- the so-called short doubly-censored (SDC) event sequences. We study this critical problem of quantitative asynchronous event sequence analysis under the framework of Hawkes processes by leveraging the …

2017-02-22abs ↗pdf ↗

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.