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

306089119 · Jun 202019922001200920172026
48 results for nonlinear least-squares

New algorithms estimate Jacobian matrices for large-scale machine learning.

problem Efficiently computing search directions for large nonlinear least squares.
method Exploit low-rank structure in Hessian to estimate Jacobian matrices.
result Two algorithms perform well compared to state-of-the-art methods.

Generalization in nonlinear least squares can be studied via algorithmic stability and effective dimension.

problem Generalization in nonlinear least squares models
method Deriving error bounds for local minimizers using algorithmic stability and effective dimension
result Bounds depend on learned geometry rather than parameter count

We learn linear models from nonlinear systems using multiple trajectories and regularization.

problem Identifying linear models from data when the underlying dynamics are nonlinear.
method Multiple trajectories data acquisition followed by regularized least squares.
result Learn linearized dynamics with arbitrarily small error given enough samples.

The paper provides a non-asymptotic error bound for linear system identification under nonlinear policies.

problem System identification for linear systems with nonlinear and/or time-varying policies under i.i.d. random excitation noises.
method Least square estimation with non-asymptotic error bound for bounded state and action trajectories.
result The error bound is consistent with linear policies and generalizes existing guarantees.

PGD algorithms solve nonlinear inverse problems with generative priors using noisy measurements.

problem Signal estimation from noisy nonlinear measurements with generative priors.
method Projected gradient descent algorithms for two cases: unknown and known nonlinearity.
result PGD algorithms converge linearly to optimal statistical rates using arbitrary initialization.

A new method estimates parameters of complex models using ordinary least squares.

problem Estimating parameters of nonlinear dynamic models from time series data.
method Physics-Informed Regression (PIR) using regularized ordinary least squares.
result PIR outperforms physics-informed neural networks (PINN) in parameter estimation.

We identify linear models from nonlinear systems with initialization constraints.

problem Identifying linear models from nonlinear systems with initialization constraints.
method Multiple trajectories-based deterministic data acquisition algorithm followed by regularized least squares.
result We provide a finite sample error bound on the learned linearized dynamics.

We study the problem of recovering a structured signal x0\mathbf{x}_0 from high-dimensional data yi=f(aiTx0)\mathbf{y}_i=f(\mathbf{a}_i^T\mathbf{x}_0) for some nonlinear (and potentially unknown) link function ff, when the regressors ai\mathbf{a}_i are iid Gaussian. Brillinger (1982) showed that ordinary least-squares estimate…

2017-12-11abs ↗pdf ↗

This book introduces linear models and their theories rigorously.

problem Understanding linear models and their theories.
method Explains linear models from three perspectives, introduces maximum likelihood estimation, and proves least squares is the best unbiased linear model.
result Least squares is the best unbiased linear model in terms of mean squared error.

Smooth, globally PŁ functions are essentially nonlinear least-squares.

problem Understanding the structure of functions satisfying the Polyak-Łojasiewicz condition.
method Analyzing smooth functions on Riemannian manifolds with the PŁ condition.
result Smooth, globally PŁ functions are of the form f(x)=f+φ(x)2f(x) = f^* + \|\varphi(x)\|^2.

Unified theory and debiasing framework for random oblique projections in high dimensions.

problem Systematic statistical bias in random oblique projections induced by sampling.
method Unified non-asymptotic theory and debiasing framework.
result Sharp bias--variance characterizations and improved approximation accuracy.

The paper proposes a least squares method for binary compressive sampling with low intrinsic dimension signals.

problem Recovering signals from binary measurements with noise and sign flips.
method Least squares decoder for signals with low generative intrinsic dimension.
result The least squares decoder achieves a sharp estimation error of O(klog(Ln)m)O(\sqrt{\frac{k\log (Ln)}{m}}) under certain conditions.

New method learns low-dimensional models for systems with non-polynomial terms.

problem Modeling systems with non-polynomial nonlinear terms that are spatially local and given in analytic form.
method Non-intrusive model reduction method that learns operators for linear and polynomially nonlinear dynamics via a least-squares problem incorporating given non-polynomial terms.
result Comparable accuracy to intrusive methods that require full knowledge of governing equations.

Improved real-time UAV terrain following with RVM-RLS filter.

problem Accurate real-time waypoints estimation under measurement noise in nonlinear, time-varying systems.
method Residual Variance Matching Recursive Least Squares (RVM-RLS) filter guided by RVME criterion.
result Improved waypoints estimation accuracy by approximately 88% compared to benchmarks.

Machine learning can improve 2SLS first stage predictions, but nonlinear methods often introduce bias.

problem Improving the first stage of 2SLS using machine learning.
method Decomposed bias into three components, investigated through simulation.
result Nonlinear machine learning methods can introduce substantial bias in second-stage estimates.

Bayesian method improves online NARMAX model identification.

problem Online identification of nonlinear systems with small sample sizes and low noise.
method Variational Bayesian inference using message passing algorithm for polynomial NARMAX models.
result Variational Bayesian estimator outperforms recursive and offline least-squares methods.

Unified multi-view learning framework using OPLS with regularization and deep extensions.

problem Improving multi-view learning for classification and feature extraction.
method Orthonormalized Partial Least Squares (OPLS) with regularization and deep extensions.
result Unified multi-view learning framework with improved performance.

Stochastic VB improves nonlinear model inference speed and accuracy.

problem Bayesian inference of nonlinear models from noisy data.
method Stochastic Variational Bayesian (VB) inference for nonlinear models.
result Stochastic VB achieves comparable parameter recovery to analytical solution but is faster.

Functional PLS improves prediction and inference for scalar responses from functional predictors.

problem Estimating scalar responses from functional predictors in an ill-posed inverse problem.
method Functional partial least squares (PLS) estimator with adaptive early stopping and new tests.
result PLS attains nearly minimax-optimal convergence rates and detects local alternatives.

We study parameter estimation and asymptotic inference for sparse nonlinear regression. More specifically, we assume the data are given by y=f(xβ)+εy = f( x^\top β^* ) + ε, where ff is nonlinear. To recover ββ^*, we propose an 1\ell_1-regularized least-squares estimator. Unlike classical linear regression, the correspondin…

2015-11-14abs ↗pdf ↗

ADMM algorithm solves nonlinear matrix decompositions efficiently.

problem Nonlinear matrix decompositions for various applications.
method Alternating Direction Method of Multipliers (ADMM) for nonlinear matrix factorization.
result The method efficiently solves diverse nonlinear matrix decompositions.

We use statistical learning methods to construct an adaptive state estimator for nonlinear stochastic systems. Optimal state estimation, in the form of a Kalman filter, requires knowledge of the system's process and measurement uncertainty. We propose that these uncertainties can be estimated from (conditioned on) past…

2014-11-03abs ↗pdf ↗

Spectral decomposition of the Koopman operator is attracting attention as a tool for the analysis of nonlinear dynamical systems. Dynamic mode decomposition is a popular numerical algorithm for Koopman spectral analysis; however, we often need to prepare nonlinear observables manually according to the underlying dynami…

2017-10-12abs ↗pdf ↗

A novel algorithm converges for solving a specific matrix decomposition problem.

problem Nonlinear matrix decomposition with ReLU function for sparse data.
method Introduced a reparametrization of the Latent-RMD model and developed eBCD for convergence proof.
result eBCD converges and outperforms state-of-the-art methods on various data sets.

A new tensor completion method using tensor networks with Tucker wrapper.

problem Low-rank tensor completion in various applications.
method Solving LRTC as a system of nonlinear equations using a two-level alternative least squares method.
result The method converges to the exact solution at a linear rate with high probability.

We present ADMM-Softmax, an alternating direction method of multipliers (ADMM) for solving multinomial logistic regression (MLR) problems. Our method is geared toward supervised classification tasks with many examples and features. It decouples the nonlinear optimization problem in MLR into three steps that can be solv…

2019-01-27abs ↗pdf ↗

Paper addresses identifiability and asymptotics of ODE systems from noisy data.

problem Identifying parameters and causal structure of linear ODE systems from discrete observations.
method Developed sufficient conditions for identifiability, proved consistency and asymptotic normality of NLS estimator, constructed confidence sets, and inferred causal structure.
result Consistent and asymptotically normal parameter estimator for linear ODE systems under mild conditions.

New method designs experiments robustly for nonlinear estimation, improving parameter knowledge.

problem Designing robust experiments for nonlinear estimation under parametric uncertainty.
method Multi-stage robust optimization framework for sequential experiments.
result Identifies experiments better conducted early for improved parameter knowledge.

Papers learn from data to make decisions without interacting, improving on previous methods.

problem Achieving optimal decision-making from offline data with non-linear function approximation.
method Pessimistic Nonlinear Least-Square Value Iteration (PNLSVI) with three innovative components.
result Achieves minimax optimal instance-dependent regret for non-linear function approximation.

Simplifies neural regression by combining two sub-networks for predictions and uncertainties.

problem Neural networks underestimate uncertainty, leading to overly confident predictions.
method Extends IRLS to a two-sub-network approach with shared representations and complementary loss functions.
result Proposed network is simpler to implement and more robust to uncertainty variations.

The paper proposes a new system ID method from noisy data.

problem System identification of linear and nonlinear non-autonomous systems from noisy and sparse data.
method Bayesian formulation for learning a hidden Markov model with stochastic dynamics, analyzed in the context of least squares and multiple shooting approaches.
result The proposed approach outperforms existing methods in terms of mean squared error and model generalizability.