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

1122 · Jun 201919922001200920172026
25 results for self-correction

Theoretical analysis shows LLMs can self-correct responses through in-context learning.

problem Understanding how large language models improve through self-correction.
method Theoretical analysis based on simplified alignment task, focusing on softmax attention, multi-head attention, and MLP blocks.
result LLMs can refine responses in an in-context way when given accurate self-examinations as rewards.

SCoreBO improves Bayesian optimization by learning hyperparameters and self-correcting.

problem Efficient hyperparameter tuning for Gaussian process models in Bayesian optimization.
method Introduces SAL and SCoreBO, which prioritize hyperparameter learning and perform simultaneous optimization and learning.
result SCoreBO outperforms state-of-the-art methods on traditional benchmarks and atypical tasks.

YOASOVI improves stochastic VI for large models with fast, self-correcting sampling.

problem Efficiently performing stochastic Variational Inference on large Bayesian models.
method YOASOVI uses acceptance sampling to draw only one sample per iteration, improving convergence speed and accuracy.
result YOASOVI converges faster and more accurately than regular Monte Carlo and Quasi-Monte Carlo methods.

This work explores test-time scaling strategies for LLMs, improving sample efficiency and expressiveness.

problem Understanding the sample efficiency and expressiveness of test-time scaling strategies for LLMs.
method Established separation and expressiveness results for self-consistency, best-of-nn, and self-correction strategies.
result Self-correction enables Transformers to simulate online learning over multiple tasks without prior knowledge.

Random feature model shows slow self-correction of generalization gap.

problem Slow deterioration of generalization error in random feature model.
method Examined the dynamic behavior of gradient descent in the model's resonance regime.
result Gradient descent exhibits a self-correction mechanism, reducing generalization gap over time.

Machine learning (ML) training algorithms often possess an inherent self-correcting behavior due to their iterative-convergent nature. Recent systems exploit this property to achieve adaptability and efficiency in unreliable computing environments by relaxing the consistency of execution and allowing calculation errors…

2018-10-17abs ↗pdf ↗

We provide further evidence that markets trend on the medium term (months) and mean-revert on the long term (several years). Our results bolster Black's intuition that prices tend to be off roughly by a factor of 2, and take years to equilibrate. The story behind these results fits well with the existence of two types …

2017-11-13abs ↗pdf ↗

Paper develops a neural network method for censored survival analysis.

problem Distribution-free quantile prediction for censored survival data.
method Develops a novel neural network algorithm for simultaneous quantile optimization.
result The algorithm produces better calibrated quantiles on real datasets.

New method uses surrogate gradients to train efficient spiking networks on neuromorphic hardware.

problem Training high-performing spiking networks on analog neuromorphic hardware is challenging due to device mismatch and lack of efficient algorithms.
method Introduces a general in-the-loop learning framework based on surrogate gradients.
result Learning self-corrects for device mismatch, resulting in competitive spiking network performance.

In this paper we propose a novel index to quantify and measure the flow of information on macro and micro scales. We discuss the implications of this index for knowledge management fields and also as intellectual capital that can thus be utilized by entrepreneurs. We explore different function and human oriented metric…

2011-06-14abs ↗pdf ↗

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.

SRPO improves AI alignment with human preferences through self-improvement and task-independent optimization.

problem AI models trained with RLHF lack self-correction mechanisms and struggle with task generalization.
method SRPO formulates the preference learning problem as a min-max objective, optimizing a self-improvement policy and a generative policy in an adversarial fashion, making the solution task-independent.
result SRPO outperforms existing methods, achieving 90% AI Win-Rate on XSum and 56% on Arena-Hard prompts after a single revision.

Study on topological order on fractal geometries, proving no-go theorem and fault-tolerant gates.

problem Investigating topological order on fractal geometries embedded in n dimensions.
method Using quantum error-correcting codes and systolic geometry to diagnose topological order.
result Proves no-go theorem for topological order on 2D fractals, survival on higher dimensions, and construction of fault-tolerant gates.