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

25.0%50.0%75.0%100.0% · Mar 199319922001200920172026
48 results for Vector Error Correction Model

Paper designs optimal ECOCs using IP for robust multiclass classification.

problem Designing robust ECOCs for multiclass classification.
method Integer Programming formulation to minimize codebooks with desirable error-correcting properties, leveraging graph-theoretic structure and edge clique covers.
result IP-generated codebooks achieve high nominal and robust adversarial accuracy.

An associative memory is a framework of content-addressable memory that stores a collection of message vectors (or a dataset) over a neural network while enabling a neurally feasible mechanism to recover any message in the dataset from its noisy version. Designing an associative memory requires addressing two main task…

2016-11-29abs ↗pdf ↗

The study examines methods to correct measurement error in nutritional epidemiology studies.

problem Measurement error in nutritional studies leads to biased and underconfident estimates.
method The article reviews various bias-correction models for exposure variables in nutritional epidemiology.
result Bias-correction methods are essential for accurate inference in nutritional studies.

A new method for math reasoning that allows for iterative correction.

problem Standard reasoning models commit to each token and cannot recover from early errors.
method Generative framework with latent thought vectors for iterative self-correction.
result 30 rethinking iterations surpass baselines with 15 times more parameters.

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.

The paper proposes a new model to analyze directed networks and accurately estimate community memberships.

problem Modeling and estimating community memberships in directed networks with heterogeneous degrees.
method Directed Degree Corrected Mixed Membership (DiDCMM) model and DiMSC algorithm.
result The proposed DiMSC algorithm is asymptotically consistent and provides error bounds for community membership vectors.

Proposes a model combining difference-attention and error-correction LSTMs for improved time series prediction.

problem Improving accuracy in time series prediction.
method Combines difference-attention LSTM and error-correction LSTM in a cascade approach.
result Improves prediction accuracy in time series.

New method combines machine learning with data assimilation for model error correction.

problem Correcting model errors using sparse and noisy observations.
method Hybrid machine learning and data assimilation methods.
result Tendency correction outperforms resolvent correction in data assimilation experiments.

This paper examines interest rates and market efficiency in DeFi loanable funds protocols.

problem Equilibrium of supply and demand for loanable funds in DeFi protocols.
method Review of interest rate mechanisms in Compound, Aave, and dYdX; empirical analysis of market efficiency and inter-connectedness.
result Interest rate rules in DeFi protocols do not always equilibrate supply and demand.

SCaSML improves PDE solvers by correcting errors efficiently.

problem Reliable and error-free high-dimensional PDE solutions.
method Defect correction method to derive a Structural-preserving Law of Defect.
result SCaSML achieves faster convergence and reduced errors in high-dimensional PDEs.

This paper establishes non-asymptotic oracle inequalities for the prediction error and estimation accuracy of the LASSO in stationary vector autoregressive models. These inequalities are used to establish consistency of the LASSO even when the number of parameters is of a much larger order of magnitude than the sample …

2013-11-04abs ↗pdf ↗

Paper analyzes iterates in high-dimensional linear models and proposes estimators for their generalization error.

problem Analyzing iterates in high-dimensional linear models with comparable feature and sample sizes.
method Novel estimators for generalization error, debiasing corrections, and valid confidence intervals.
result Estimators are n\sqrt{n}-consistent and can be used for early stopping.

The paper corrects for node degree in spectral clustering using random walk Laplacian.

problem Node degree heterogeneity in spectral clustering.
method Graph spectral embedding using the random walk Laplacian.
result The embedding provides uniformly consistent estimates of degree-corrected latent positions.

Corrected samplers reduce discretization error in discrete flow models without additional computational cost.

problem Discretization error in samplers for discrete flow models.
method Established non-asymptotic error bounds for samplers, proposed time-corrected and location-corrected samplers.
result Location-corrected sampler has lower complexity and better generation quality.

In this work, we present a family of vector quantization schemes \emph{vqSGD} (Vector-Quantized Stochastic Gradient Descent) that provide an asymptotic reduction in the communication cost with convergence guarantees in first-order distributed optimization. In the process we derive the following fundamental information …

2019-11-18abs ↗pdf ↗

New method corrects seasonal Arctic sea ice predictions with probabilistic models.

problem Systematic biases and errors in climate model forecasts of Arctic sea ice.
method Conditional Variational Autoencoder model to map observation distribution given biased model predictions.
result Probabilistic adjusted forecasts are better calibrated and have smaller errors.

Fault-tolerant neural networks inspired by biological error correction codes.

problem Achieving reliable computation with unreliable neurons.
method Using biological error correction codes from grid cells in the mammalian cortex to develop a fault-tolerant neural network.
result Noisy biological neurons operate below a fault-tolerance threshold, suggesting a mechanism for reliable computation in the brain.

Quantum codes on hyperbolic lattices outperform Euclidean ones with higher rates and lower overhead.

problem Improving quantum error correction performance with hyperbolic lattices.
method Unified framework using Hyperbolic Cycle Basis algorithm for CSS codes construction and benchmarking.
result Achieved higher encoding rates and lower qubit overhead in hyperbolic quantum error correction codes.

Neural operators correct PDE residuals to improve BIP solutions.

problem Reducing error in infinite-dimensional Bayesian inverse problems with neural operators.
method Error correction using PDE residuals to improve neural operator approximation.
result Trained neural operators with error correction achieve a quadratic reduction in approximation error.

CRC improves multivariate forecasting accuracy without risking performance degradation.

problem Systematic errors and lack of guarantees in multivariate forecasters.
method CRC uses a causality-inspired encoder and hybrid corrector with a safety mechanism.
result CRC consistently improves accuracy and ensures high non-degradation rates.

The paper tackles model misspecification in reinforcement learning through a bootstrapped neural network and error correction.

problem Model misspecification in reinforcement learning environments.
method Proposes a bootstrapped multi-headed neural network to learn model distributions and a global error correction filter.
result Demonstrates increased performance and stability in model accuracy and planning algorithm use.

LLMs struggle with zero-shot annotation tasks due to model-internalized priors.

problem Impact of model-internalized priors on LLM performance in zero-shot annotation tasks.
method Investigated three dimensions: familiarity, decision stickiness, and susceptibility to misaligned task definitions.
result Nearly two-thirds of zero-shot errors are resistant to correction, with a rescue rate of 34.8%. Definition-Specific Familiarity (DSF) shows a positive association with model performance.

Autonomy and adaptation of machines requires that they be able to measure their own errors. We consider the advantages and limitations of such an approach when a machine has to measure the error in a regression task. How can a machine measure the error of regression sub-components when it does not have the ground truth…

2019-06-17abs ↗pdf ↗

Theoretical work shows integrating coherent reasoning improves LLM performance and error correction.

problem Improving reasoning and error correction in large language models (LLMs) with few-shot prompting.
method Theoretical analysis and sensitivity experiments on transformer behavior with coherent reasoning and corrupted demonstrations.
result The transformer gains better error correction ability and more accurate predictions when coherent reasoning is integrated.

We introduce the speculate-correct method to derive error bounds for local classifiers. Using it, we show that k nearest neighbor classifiers, in spite of their famously fractured decision boundaries, have exponential error bounds with O(sqrt((k + ln n) / n)) error bound range for n in-sample examples.

2014-10-09abs ↗pdf ↗

This work presents a technique for statistically modeling errors introduced by reduced-order models. The method employs Gaussian-process regression to construct a mapping from a small number of computationally inexpensive `error indicators' to a distribution over the true error. The variance of this distribution can be…

2014-05-20abs ↗pdf ↗