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

4794141188 · Jun 202019922001200920172026
48 results for Ordinary Least Squares

We compare the risk of ridge regression to a simple variant of ordinary least squares, in which one simply projects the data onto a finite dimensional subspace (as specified by a Principal Component Analysis) and then performs an ordinary (un-regularized) least squares regression in this subspace. This note shows that …

2011-05-04abs ↗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.

We develop efficient algorithms to estimate the stability of Ordinary Least Squares regression results.

problem Measuring the stability of regression conclusions in low dimensions.
method Efficient algorithms for estimating the minimum number of samples that need to be removed to change a regression conclusion.
result We can estimate stability up to a factor of 3 better than the greedy heuristic and certify stability even for dropping a majority of samples.

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.

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.

Ordinary least squares (OLS) is the default method for fitting linear models, but is not applicable for problems with dimensionality larger than the sample size. For these problems, we advocate the use of a generalized version of OLS motivated by ridge regression, and propose two novel three-step algorithms involving l…

2015-06-07abs ↗pdf ↗

Efficiently estimates private least squares with linear error growth.

problem Private estimation of ordinary least squares with bounded residuals and leverage.
method Scaled noise added to a stable nonprivate estimator of the regression vector.
result Near-optimal accuracy guarantee with linear error growth in dimension.

This study examines the relationship between PLS and OLS regression using eigenvalue distributions.

problem Analyzing the difference between PLS and OLS regression in terms of eigenvalue distributions.
method Examined the distance between PLS and OLS regression coefficients using the Mahalanobis distance and eigenvalue distributions of the regressor covariance matrix.
result Provided a bound on the distance between PLS and OLS regression coefficients that depends only on the eigenvalue distribution of the regressor covariance matrix.

The paper explores how overfitting can lead to better predictions in high-dimensional data.

problem Understanding the behavior of linear models in high-dimensional settings with more predictors than observations.
method Analysis of ordinary least squares, penalized least squares, and spectral shrinkage estimates.
result The phenomenon of double descent, where model performance can improve with increasing model complexity.

Optimal noise excitation for linear system identification reduces sample complexity.

problem Efficiently identifying linear systems with minimal data.
method Active learning algorithm using ordinary least squares and semidefinite programming.
result The proposed algorithm matches lower bounds on sample complexity for any active learning method.

This paper reviews SDR methods for multivariate response regression.

problem Handling sufficient dimension reduction for multivariate response regression.
method Characterizes SDR estimators as inverse or forward regression methods.
result Pooled marginal, projective resampling, distance-based, ordinary least squares, partial least squares, and semiparametric SDR estimators are discussed.

Subsampling methods have been recently proposed to speed up least squares estimation in large scale settings. However, these algorithms are typically not robust to outliers or corruptions in the observed covariates. The concept of influence that was developed for regression diagnostics can be used to detect such corrup…

2014-06-12abs ↗pdf ↗

BCDP enhances privacy by protecting sensitive features more precisely.

problem Uniform privacy protection in LDP degrades performance for sensitive features.
method Bayesian Coordinate Differential Privacy (BCDP) adjusts privacy protection per feature sensitivity.
result BCDP improves accuracy in downstream tasks without sacrificing privacy.

Ensemble methods that average over a collection of independent predictors that are each limited to a subsampling of both the examples and features of the training data command a significant presence in machine learning, such as the ever-popular random forest, yet the nature of the subsampling effect, particularly of th…

2019-10-10abs ↗pdf ↗

We study the least squares regression problem \begin{align*} \min_{Θ\in \mathcal{S}_{\odot D,R}} \|AΘ-b\|_2, \end{align*} where SD,R\mathcal{S}_{\odot D,R} is the set of ΘΘ for which Θ=r=1Rθ1(r)θD(r)Θ= \sum_{r=1}^{R} θ_1^{(r)} \circ \cdots \circ θ_D^{(r)} for vectors θd(r)Rpdθ_d^{(r)} \in \mathbb{R}^{p_d} for all r[R]r \in [R] and $d \in [D]…

2017-09-20abs ↗pdf ↗

New algorithms protect user data while optimizing personalized decisions.

problem Personalized decision-making with private user data.
method Developed LDP algorithms for stochastic generalized linear bandits using SGD and OLS.
result Achieved the same regret bound as non-privacy settings with LDP.

Improved privacy-preserving linear regression via iterative Hessian mixing.

problem Differentially private linear regression with improved accuracy and efficiency.
method Iterative Hessian Mixing (IHM) for differentially private ordinary least squares (DP-OLS).
result IHM provides better utility guarantees and outperforms AdaSSP in empirical evaluations.

We study the total least squares (TLS) problem that generalizes least squares regression by allowing measurement errors in both dependent and independent variables. TLS is widely used in applied fields including computer vision, system identification and econometrics. The special case when all dependent and independent…

2014-06-01abs ↗pdf ↗

Study ablated data augmentation techniques and their mathematical equivalence to penalties.

problem Lack of mathematical understanding of differences between ablated data augmentation techniques.
method Formal model of mean ablated data augmentation and inverted dropout for linear regression; empirical validation for deep networks.
result Ablated data augmentation and inverted dropout are mathematically equivalent to penalties in optimization.

Cross-validation estimates model performance on unseen data, not training data.

problem Understanding how cross-validation estimates prediction error and its limitations.
method Analyzing linear models and popular prediction error estimates, introducing nested cross-validation.
result Cross-validation estimates the average prediction error of models fit on other unseen training sets, not the model at hand.

We consider the problem of predicting as well as the best linear combination of d given functions in least squares regression, and variants of this problem including constraints on the parameters of the linear combination. When the input distribution is known, there already exists an algorithm having an expected excess…

2009-02-10abs ↗pdf ↗

We propose a novel linear discriminant analysis approach for the classification of high-dimensional matrix-valued data that commonly arises from imaging studies. Motivated by the equivalence of the conventional linear discriminant analysis and the ordinary least squares, we consider an efficient nuclear norm penalized …

2018-09-24abs ↗pdf ↗

This work improves SINDy-type algorithms for system identification using score-guided dictionary selection.

problem Improving accuracy and interpretability in dynamical system identification.
method Score-guided library selection to refine dictionary terms in sparse regression.
result Score-guided methods enhance SINDy's robustness in discovering governing equations.

The optimal predictor for a linear dynamical system (with hidden state and Gaussian noise) takes the form of an autoregressive linear filter, namely the Kalman filter. However, a fundamental problem in reinforcement learning and control theory is to make optimal predictions in an unknown dynamical system. To this end, …

2019-05-23abs ↗pdf ↗

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 ↗

We introduce a balloon estimator in a generalized expectation-maximization method for estimating all parameters of a Gaussian mixture model given one data sample per mixture component. Instead of limiting explicitly the model size, this regularization strategy yields low-complexity sparse models where the number of eff…

2018-12-11abs ↗pdf ↗

Transformers learn a mesa-optimizer to implement in-context learning.

problem Understanding the convergence of autoregressive training to a mesa-optimizer.
method Investigated a one-layer linear causal self-attention model autoregressively trained by gradient flow.
result Proved that autoregressive training converges to a gradient descent step for an OLS problem, validating the mesa-optimizer hypothesis.

This work gives a simultaneous analysis of both the ordinary least squares estimator and the ridge regression estimator in the random design setting under mild assumptions on the covariate/response distributions. In particular, the analysis provides sharp results on the ``out-of-sample'' prediction error, as opposed to…

2011-06-13abs ↗pdf ↗