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

144288431575 · Jun 202019922001200920172026
48 results for test error reduction

We present local discriminative Gaussian (LDG) dimensionality reduction, a supervised dimensionality reduction technique for classification. The LDG objective function is an approximation to the leave-one-out training error of a local quadratic discriminant analysis classifier, and thus acts locally to each training po…

2012-06-18abs ↗pdf ↗

Infinitesimal boosting converges to a deterministic process in large sample limit.

problem Characterizing the asymptotic behavior of infinitesimal gradient boosting in large sample sizes.
method Proving convergence to a deterministic process using large sample theory and differential equations.
result The test error decreases over time in the population limit.

A new kernel test reduces noise in MMD by focusing on leading eigen-directions.

problem Noise in trailing directional components degrades power of standard kernel two-sample tests.
method Truncate MMD spectral decomposition, retaining only leading eigen-directions.
result Our method achieves superior power and robustness, especially in high-dimensional and unbalanced settings.

We accelerate CNF by reducing ODE truncation errors with polynomial regularization.

problem High computation cost of CNF due to large truncation errors in solving ODEs.
method Add polynomial regularization to approximate ODE trajectories with polynomial functions.
result 42.3% to 71.3% reduction of NFE on density estimation, 19.3% to 32.1% on variational auto-encoder.

The paper reduces estimation error in predicting borrower repayment by accounting for lender's credit decisions.

problem Estimation error in predicting borrower repayment due to confounding effects.
method Proposes new estimators to reduce estimation error, combining theoretical analysis and numerical testing.
result The proposed estimators are unbiased, consistent, and robust, showing substantial reduction in estimation error.

A novel approach is put forth that utilizes data similarity, quantified on a graph, to improve upon the reconstruction performance of principal component analysis. The tasks of data dimensionality reduction and reconstruction are formulated as graph filtering operations, that enable the exploitation of data node connec…

2018-09-25abs ↗pdf ↗

In the covariate shift learning scenario, the training and test covariate distributions differ, so that a predictor's average loss over the training and test distributions also differ. In this work, we explore the potential of extreme dimension reduction, i.e. to very low dimensions, in improving the performance of imp…

2017-11-29abs ↗pdf ↗

Proposes a fuzzy rule-based method for data visualization.

problem Preserving neighborhood relationships and handling non-linear manifolds in data visualization.
method Uses a first-order Takagi-Sugeno model with clusters and Geodesic c-means clustering for rule generation and parameter estimation.
result Behaves desirably and performs better than or comparable to other methods.

Data-aware activation function customization reduces neural network error.

problem Current neural networks lack consideration for specific activation functions.
method Linear algebraic explanation and Diaconis-Shahshahani Approximation Theorem criteria for activation functions.
result Using an even activation function like seagull can reduce neural network error by orders of magnitude.

HSR reduces analyst earnings forecast errors by lowering travel friction.

problem How HSR connectivity affects analyst earnings forecast errors in China.
method Firm-year panel data from 2008-2019; placebo test to rule out pre-existing trends.
result HSR reduces analyst earnings forecast errors after connectivity, not before.

Testing the implementation of deep learning systems and their training routines is crucial to maintain a reliable code base. Modern software development employs processes, such as Continuous Integration, in which changes to the software are frequently integrated and tested. However, testing the training routines requir…

2019-01-14abs ↗pdf ↗

Unified approach combines prediction-powered inference and variance reduction for semi-supervised optimization.

problem Scarcity of labeled data in semi-supervised optimization.
method PPI-SVRG, combining PPI and SVRG methods.
result Unified convergence bound with improved performance under label scarcity.

Redundancy in AI perception systems doesn't guarantee independent error occurrences.

problem Lack of direct statistical evidence of super-human automated driving performance.
method Investigated the effectiveness of redundancy in neural networks for independent error occurrences.
result Errors in neural networks for computer vision tasks are correlated, not independent.

In this paper we propose strategies for estimating performance of a classifier when labels cannot be obtained for the whole test set. The number of test instances which can be labeled is very small compared to the whole test data size. The goal then is to obtain a precise estimate of classifier performance using as lit…

2016-07-09abs ↗pdf ↗

This review tackles long horizon forecasting in time series analysis using deep learning.

problem Long horizon forecasting in time series analysis.
method Incorporates deep learning techniques such as trend, seasonality, Fourier and wavelet transforms, and various model architectures.
result LHF is an error propagation problem, with models like xLSTM and Triformer showing better performance.

Study reveals pervasive label errors in test sets, affecting machine learning benchmarks.

problem Label errors in test sets destabilize machine learning benchmarks.
method Identified label errors in 10 common datasets using confident learning algorithms and human validation.
result Lower capacity models may be more useful in real-world datasets with high proportions of erroneously labeled data.

This paper tackles fairness in PCA by balancing it with reconstruction error.

problem Fairness concerns in PCA due to different group representation errors.
method A multi-objective optimization approach to balance fairness and reconstruction error.
result Achieving fairness with minimal loss in reconstruction error.

We present a novel Monte Carlo based LSV calibration algorithm that applies to all stochastic volatility models, including the non-Markovian rough volatility family. Our framework overcomes the limitations of the particle method proposed by Guyon and Henry-Labordère (2012) and theoretically guarantees a variance reduct…

2019-09-29abs ↗pdf ↗

We characterize the asymptotic performance of nonparametric one- and two-sample testing. The exponential decay rate or error exponent of the type-II error probability is used as the asymptotic performance metric, and an optimal test achieves the maximum rate subject to a constant level constraint on the type-I error pr…

2019-08-27abs ↗pdf ↗

This paper examines how labeling error affects contrastive learning and proposes data dimensionality reduction methods to mitigate its impact.

problem The impact of labeling error on the performance of contrastive learning.
method Data dimensionality reduction methods (e.g., SVD) are applied to reduce false positive samples and improve downstream classification accuracy.
result Data dimensionality reduction methods can mitigate the negative impacts of labeling error on downstream classification performance.

Proposes a new test for validating multivariate dynamic regression models.

problem Inadequate exogeneity conditions for conventional model specification tests in dynamic systems.
method Develops a generalized Durbin estimator for multiple-equation systems with dynamic dependencies, and constructs Wald tests.
result Bootstrap-based Wald tests improve finite-sample size control and validate the null hypothesis in multifactor models.

This paper introduces a new unsupervised method for dimensionality reduction via regression (DRR). The algorithm belongs to the family of invertible transforms that generalize Principal Component Analysis (PCA) by using curvilinear instead of linear features. DRR identifies the nonlinear features through multivariate r…

2016-01-31abs ↗pdf ↗

The repeated community-wide reuse of test sets in popular benchmark problems raises doubts about the credibility of reported test-error rates. Verifying whether a learned model is overfitted to a test set is challenging as independent test sets drawn from the same data distribution are usually unavailable, while other …

2019-03-06abs ↗pdf ↗

Study loop corrections in random feature models affecting training and test errors.

problem Analyzing loop corrections in random feature models to understand training and test errors.
method Statistical physics and effective field theory approach to study loop corrections.
result Derived loop corrections to training error, test error, and generalization gap.

Overparameterized deep networks have the capacity to memorize training data with zero \emph{training error}. Even after memorization, the \emph{training loss} continues to approach zero, making the model overconfident and the test performance degraded. Since existing regularizers do not directly aim to avoid zero train…

2020-02-20abs ↗pdf ↗

DD algorithm tracks test error from train error without validation data.

problem Systematic generalization gap between train and test errors in modern model training.
method Decoupled descent (DD) algorithm that cancels data reuse biases via approximate message passing.
result DD algorithm rigorously demonstrates zero-cost validation and 100% data utilization.

Sparse model for noisy datasets using hierarchical regularization.

problem Learning from large noisy datasets with sparse representations.
method Hierarchical learning strategy with projection-based penalty operators.
result Efficient sparse model reconstruction and generalizability on real datasets.

We use an adversarial expert based online learning algorithm to learn the optimal parameters required to maximise wealth trading zero-cost portfolio strategies. The learning algorithm is used to determine the relative population dynamics of technical trading strategies that can survive historical back-testing as well a…

2019-03-06abs ↗pdf ↗