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

316394125 · Oct 201919922001200920172026
48 results for human thought

AI systems that explain their decisions can be monitored for harmful intentions.

problem Monitoring AI systems' decision-making processes for harmful intentions is imperfect and can miss some misbehavior.
method Monitoring the chain of thought (CoT) of AI systems that communicate in human language.
result CoT monitoring is a promising but fragile approach to AI safety.

Have you ever looked at a machine learning classification model and thought, I could have made that? Well, that is what we test in this project, comparing XGBoost trained on human engineered features to training directly on data. The human engineered features do not outperform XGBoost trained di- rectly on the data, bu…

2016-09-04abs ↗pdf ↗

LLMs struggle with financial reasoning but can outperform the market with human oversight.

problem Financial reasoning failures in LLM-generated stock market predictions.
method Evaluated four LLMs using three prompting strategies and compared to human oversight.
result LLMs require human oversight to fully realize their potential in financial markets.

State of the art deep reinforcement learning algorithms take many millions of interactions to attain human-level performance. Humans, on the other hand, can very quickly exploit highly rewarding nuances of an environment upon first discovery. In the brain, such rapid learning is thought to depend on the hippocampus and…

2016-06-14abs ↗pdf ↗

The Gestalt laws of perceptual organization, which describe how visual elements in an image are grouped and interpreted, have traditionally been thought of as innate despite their ecological validity. We use deep-learning methods to investigate whether natural scene statistics might be sufficient to derive the Gestalt …

2019-03-04abs ↗pdf ↗

Machine learning uses crowdworkers; determining their status as human subjects is tricky.

problem Determining the appropriate status of ML crowdworkers as human subjects.
method Investigation of natural language processing studies to expose challenges and propose solutions.
result Potential loophole in the U.S. Common Rule for ML research oversight.

A method for learning with autoregressive chain-of-thoughts.

problem Learning prompt-to-answer mappings from sequence-to-next-token generators.
method Iterating a fixed, time-invariant generator for multiple steps to generate a chain-of-thought, then taking the final token as the answer.
result Universal representability and computationally tractable chain-of-thought learning for a simple base class.

The Allais and Ellsberg paradoxes show that the expected utility hypothesis and Savage's Sure-Thing Principle are violated in real life decisions. The popular explanation in terms of 'ambiguity aversion' is not completely accepted. On the other hand, we have recently introduced a notion of 'contextual risk' to mathemat…

2011-05-09abs ↗pdf ↗

Can an algorithm create original and compelling fashion designs to serve as an inspirational assistant? To help answer this question, we design and investigate different image generation models associated with different loss functions to boost creativity in fashion generation. The dimensions of our explorations include…

2018-04-03abs ↗pdf ↗

Machine learning tasks entail the use of complex computational pipelines to reach quantitative and qualitative conclusions. If some of the activities in a pipeline produce erroneous or uninformative outputs, the pipeline may fail or produce incorrect results. Inferring the root cause of failures and unexpected behavior…

2020-02-11abs ↗pdf ↗

Recent work in reinforcement learning demonstrated that learning solely through self-play is not only possible, but could also result in novel strategies that humans never would have thought of. However, optimization methods cast as a game between two players require careful tuning to prevent suboptimal results. Hence,…

2019-05-17abs ↗pdf ↗

The visual systems of many mammals, including humans, is able to integrate the geometric information of visual stimuli and to perform cognitive tasks already at the first stages of the cortical processing. This is thought to be the result of a combination of mechanisms, which include feature extraction at single cell l…

2014-07-02abs ↗pdf ↗

This paper introduces a machine for sampling approximate model-X knockoffs for arbitrary and unspecified data distributions using deep generative models. The main idea is to iteratively refine a knockoff sampling mechanism until a criterion measuring the validity of the produced knockoffs is optimized; this criterion i…

2018-11-16abs ↗pdf ↗

Protein Thoughts interprets protein interactions with clear reasoning, improving prediction accuracy.

problem Lack of mechanistic justification in protein-protein interaction predictions.
method Interpretable search problem reformulation, hypothesis-guided entropy-regularized Tree-of-Thoughts search, embedding-space flow matching.
result Improves mean best-binder rank from 47.7 to 11.2 on SHS148k benchmark.

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.

Supervised machine learning models boast remarkable predictive capabilities. But can you trust your model? Will it work in deployment? What else can it tell you about the world? We want models to be not only good, but interpretable. And yet the task of interpretation appears underspecified. Papers provide diverse and s…

2016-06-10abs ↗pdf ↗

Optimal sample complexity for autoregressive chain-of-thought learning proven.

problem Determining the minimum number of samples needed for accurate autoregressive chain-of-thought learning.
method Proved upper bound on sample complexity using Daniely-Shalev-Shwartz dimension and roll-out stable parity dimension.
result The sample complexity is bounded by the local next-token class rate, with no dependence on rollout length.

Transformers learn chain-of-thought reasoning for longer problems, proving length generalization.

problem Challenging problems require deeper reasoning, but how do models generalize this to longer tasks?
method Theoretical analysis of transformers on synthetic state-tracking tasks, proving length generalization through attention concentration.
result Transformers can learn chain-of-thought reasoning for longer problems, proving length generalization.

Prefix consistency improves model reliability by weighting answers based on their reproducibility.

problem Improving the reliability of large language models' reasoning traces.
method Use prefix consistency to weight candidate answers based on their reproducibility during regeneration.
result Prefix consistency is the best correctness predictor, reaching Standard MV plateau accuracy with up to 21x fewer tokens.

This paper improves learning complex functions with CoT supervision, reducing sample complexity.

problem Learning complex functions with multi-step reasoning.
method Develops a statistical theory linking CoT risk and end-to-end risk, using CoT information measure.
result CoT supervision can achieve significantly faster learning rates compared to standard E2E supervision.

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.

This work analyzes CoT prompting methods from a statistical estimation perspective.

problem Improving the effectiveness of LLMs in solving multi-step reasoning problems.
method Introducing a multi-step latent variable model to characterize CoT prompting from a statistical estimation viewpoint.
result The CoT estimator is equivalent to a Bayesian estimator when the pretraining dataset is large.

A (complete) matching of the cells of a triangulated manifold can be thought as a combinatorial or discrete version of a nonsingular vector field. We give several methods for constructing such matchings.

2018-08-28abs ↗pdf ↗

Summarizes financial news for better investment decisions.

problem Information overload from financial news hinders timely investment decisions.
method Personalized Chain-of-Thought summarization framework integrating user-specified keywords.
result Personalized summaries highlight relevant market signals, improving investment narratives.

Transformers solve parity problems efficiently with step-by-step reasoning.

problem Training transformers to solve complex, recursive problems like parity.
method Training a one-layer transformer to solve kk-parity, incorporating intermediate parities into the loss function, and using teacher forcing or augmented data.
result Transformers can learn parity in one gradient update with intermediate supervision or self-consistency checks.

Study reveals how depth of reasoning affects generalization in models.

problem Understanding scaling behavior of generalization with CoT depth.
method Theoretical model of CoT in linear regression using random matrix theory.
result Sharp phase transition between exponential and polynomial improvement, saturation, and overthinking.

CoT-UQ improves LLM uncertainty quantification by integrating reasoning steps.

problem LLMs' overconfidence and lack of response-wise uncertainty quantification.
method Integrates LLMs' reasoning steps into uncertainty estimation.
result Significantly improves uncertainty quantification accuracy (5.9% AUROC improvement).

Fractured Sampling improves LLM reasoning efficiency by truncating CoT trajectories.

problem Efficiently scaling reasoning in large language models with limited tokens.
method Integrating truncated Chain-of-Thought (CoT) with Fractured Sampling across multiple dimensions.
result Fractured Sampling achieves superior accuracy-cost trade-offs compared to full CoT.

The paper studies how search and distillation improve reasoning in large language models.

problem Improving reasoning capabilities of large language models.
method Viewing chain-of-thought generation as a metastable Markov process, proving benefits of search and distillation.
result Search protocol rewards sparse edges, reducing the expected number of steps to reach different clusters.

The paper explores how LLMs with CoT improve performance on complex tasks.

problem Understanding the mechanisms behind LLMs' improved performance with CoT.
method Using circuit complexity theory, the paper examines LLMs' expressivity in solving mathematical and decision-making problems.
result LLMs with CoT can generate correct solutions step-by-step, even for complex tasks.

CoT enhances transformer accuracy on serial tasks by enabling serial computation.

problem Improving accuracy of large language models on inherently serial problems.
method Integrating a chain of thought (CoT) into decoder-only transformers to enable serial computation.
result Constant-depth transformers with CoT can solve problems in AC^0, surpassing TC^0 without CoT.

A conformal procedure improves CoT reasoning by aggregating reasoning paths and calibrating abstention rules.

problem Aggregation uncertainty in chain-of-thought reasoning makes correct answers less reliable.
method Introduces a conformal procedure for CoT reasoning that uses weighted score aggregation and abstention rules.
result Achieves higher selective accuracy with abstention, reducing confident-error rate.