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

3672107143 · Jun 202019922001200920172026
48 results for Forward reasoning

Forward-prediction models enhance physical reasoning, but only for specific tasks.

problem Improving physical reasoning in complex tasks involving many objects.
method Incorporated forward-prediction models into simple physical-reasoning agents and evaluated their performance on the PHYRE benchmark.
result Forward-prediction models improve physical-reasoning performance, especially on complex tasks, but generalization to new task templates is challenging.

The study compares feed-forward and attention layers in language models.

problem Understanding the role of feed-forward and attention layers in language models.
method Empirical and theoretical analysis in a synthetic setting.
result Feed-forward layers learn simple distributional associations, while attention layers focus on in-context reasoning.

Transformers learn multi-step reasoning through gradient descent.

problem Understanding how transformers solve symbolic multi-step reasoning tasks.
method Theoretical analysis of gradient descent dynamics and multi-phase training.
result Trained one-layer transformers can solve both backward and forward reasoning tasks with generalization guarantees.

Transformers improve logical reasoning on longer proofs but struggle with length.

problem Understanding systematic generalization in neural proof generation.
method Soft theorem-proving using Transformer models, evaluating logical consistency and inference accuracy.
result Transformers improve generalization with longer proofs but have difficulty with length.

New approach uses 'forward-looking' counterfactuals for treatment choice.

problem Using traditional 'retrospective' counterfactuals in treatment choice leads to counterintuitive results.
method Introduces 'counterfactual treatment choice' for forward-looking counterfactuals.
result Mismatches between interventional and forward-looking counterfactuals can lead to counterintuitive results.

KINet learns object interactions without supervision for robotic pushing.

problem Lack of supervised data for object-centric forward prediction.
method End-to-end unsupervised framework using keypoint representation and contrastive estimation.
result Automatically generalizes to unseen scenarios and accurately predicts future states.

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.

The paper addresses human-like decision-making in multi-agent systems using bounded risk-sensitive Markov Games.

problem Modeling human-like decision-making in multi-agent systems with risk-seeking and loss-aversion behaviors.
method Forward policy design and inverse reward learning with iterative reasoning and cumulative prospect theory.
result The proposed algorithms demonstrate both risk-averse and risk-seeking behaviors in multi-agent systems.

In his stimulating article on the reasons for two puzzling observations about the behaviour of interest rates, exchange rates and the rate of inflation, Charles Engel (2016) puts forward an explanation that rests on the concept of a non-pecuniary liquidity return on assets. Albeit intriguing the analysis struggles to a…

2016-04-29abs ↗pdf ↗

This article provides a comprehensive study of different ways to make speed benchmarks of gradient boosted decision trees algorithm. We show main problems of several straight forward ways to make benchmarks, explain, why a speed benchmarking is a challenging task and provide a set of reasonable requirements for a bench…

2018-10-24abs ↗pdf ↗

Thinking LLMs struggle with stock prediction, especially as data complexity increases.

problem Evaluating the performance of 'thinking' LLMs in stock prediction, especially under varying levels of cross-sectional complexity.
method Rolling 48m/1m walk-forward evaluation, comparing direct LLMs, TLLMs, and classical learners on cross-sectional ranking loss, MSE, and backtests with transaction costs.
result TLLMs' ranking quality deteriorates as cross-sectional complexity grows, while direct LLMs remain stable.

A VAE model predicts material properties and microstructures.

problem Building forward and inverse structure-property linkages in materials science.
method Combines VAE with regression, using a two-level prior and multi-modal Gaussian mixture.
result The model achieves accurate forward and inverse predictions of material properties and microstructures.

Language grounded image understanding tasks have often been proposed as a method for evaluating progress in artificial intelligence. Ideally, these tasks should test a plethora of capabilities that integrate computer vision, reasoning, and natural language understanding. However, rather than behaving as visual Turing t…

2019-04-19abs ↗pdf ↗

Transformers mimic Bayesian reasoning in controlled settings, revealing geometric mechanisms.

problem Verifying if transformers perform Bayesian reasoning rigorously in natural data.
method Constructing Bayesian wind tunnels with known posteriors and proving memorization impossibility.
result Transformers achieve 10310^{-3}-10410^{-4} bit accuracy in Bayesian posteriors, while MLPs fail.

Improves predictions by integrating forward-looking views into dynamic factor models.

problem Poor forecasts from historical data when dynamics change.
method Combines historical data with forward-looking views using a dynamic factor model.
result Derives optimal portfolio strategies influenced by both myopic and intertemporal factors.

Recent work on fairness in machine learning has focused on various statistical discrimination criteria and how they trade off. Most of these criteria are observational: They depend only on the joint distribution of predictor, protected attribute, features, and outcome. While convenient to work with, observational crite…

2017-06-08abs ↗pdf ↗

Study reveals limitations of fair representation learning methods and cautions against their use in performance-sensitive tasks.

problem Limitations of fair representation learning methods in performance-sensitive tasks.
method Using causal reasoning, the study defines and formalizes different sources of dataset bias and examines the performance of fair representation learning under distribution shifts.
result Fundamental limitations on fair representation learning when evaluation data is drawn from the same distribution as training data.

Deep learning is increasingly being used in high-stake decision making applications that affect individual lives. However, deep learning models might exhibit algorithmic discrimination behaviors with respect to protected groups, potentially posing negative impacts on individuals and society. Therefore, fairness in deep…

2019-08-23abs ↗pdf ↗

Dropout is a popular regularization technique in deep learning. Yet, the reason for its success is still not fully understood. This paper provides a new interpretation of Dropout from a frame theory perspective. By drawing a connection to recent developments in analog channel coding, we suggest that for a certain famil…

2018-10-14abs ↗pdf ↗

Cascading flows improve variational inference in structured programs.

problem Challenges in variational inference for complex probabilistic programs.
method Integrates normalizing flows and ASVI to create cascading flows, which embed the forward-pass of probabilistic programs.
result Cascading flows outperform normalizing flows and ASVI in structured inference problems.

Detects corruption in agentic models during execution.

problem Inconsistent context, retrieval errors, or adversarial inputs corrupt intermediate steps of reasoning chains.
method Analyzes token graphs induced by attention and computes spectral statistics to emit accept/reject signals.
result A single threshold on the high frequency energy ratio optimally detects context inconsistency in agentic models.

The paper explores how neural networks learn logical functions and their generalization error.

problem Learning logical functions with neural networks and understanding generalization error.
method Gradient descent on neural networks, analyzing noise-stability and Boolean influence.
result Gradient descent on certain neural architectures tends to favor low-degree representations, impacting generalization error.

The paper critiques existing uncertainty concepts and proposes a new decision-theoretic approach.

problem Incoherence in existing discussions of aleatoric and epistemic uncertainty.
method Decision-theoretic perspective that relates uncertainty, predictive performance, and statistical dispersion.
result Popular information-theoretic quantities can be poor estimators but still useful for guiding data acquisition.

A dry decade in the Navajo Nation has killed vegetation, dessicated soils, and released once-stable sand into the wind. This sand now covers one-third of the Nation's land, threatening roads, gardens and hundreds of homes. Many arid regions have similar problems: global warming has increased dune movement across farmla…

2019-12-13abs ↗pdf ↗

The relational model is a ubiquitous representation of big-data, in part due to its extensive use in databases. In this paper, we propose the Equivariant Entity-Relationship Network (EERN), which is a Multilayer Perceptron equivariant to the symmetry transformations of the Entity-Relationship model. To this end, we ide…

2019-03-21abs ↗pdf ↗

Modern approaches to stock pricing in quantitative finance are typically founded on the 'Black-Scholes model' and the underlying 'random walk hypothesis'. Empirical data indicate that this hypothesis works well in stable situations but, in abrupt transitions such as during an economical crisis, the random walk model fa…

2011-10-24abs ↗pdf ↗

New method for dynamic valuation in markets with random endowments.

problem Dynamic valuation in markets with random endowments.
method Developed new FBSDE systems and established optimality conditions.
result Established necessary and sufficient conditions for optimality.

This paper shows how forward rate interpolations are equivalent to discount factor interpolations in yield curve construction.

problem The challenge of choosing between different interpolation methods for yield curve construction.
method Demonstrates the equivalence between forward rate interpolations and discount factor interpolations.
result Some popular interpolation methods on forward rates are equivalent to classical interpolation methods on discount factors.

The biological plausibility of the backpropagation algorithm has long been doubted by neuroscientists. Two major reasons are that neurons would need to send two different types of signal in the forward and backward phases, and that pairs of neurons would need to communicate through symmetric bidirectional connections. …

2018-08-14abs ↗pdf ↗

This paper defines less discriminatory algorithms and explores their feasibility.

problem Creating algorithms that are less discriminatory while meeting business needs.
method Formal definition of less discriminatory algorithms, evaluation of feasibility, and search for alternatives.
result Formal definitions of less discriminatory algorithms face challenges due to lack of held-out data, necessitating a reliance on reasonableness standards.

Paper explores volatility swaps in rough volatility models.

problem Understanding volatility swaps in rough volatility models.
method Examines the relationship between forward start volatility swaps and implied volatilities in rough volatility models.
result The leading term approximation error in the correlated case does not depend on the time to forward start date.

HierarchicalForecast provides a Python framework for coherent hierarchical forecasting.

problem Ensuring forecasts at disaggregate levels add up to aggregate forecasts.
method Preprocessed datasets, evaluation metrics, and statistical baseline models.
result Python-based reference framework for statistical and ML forecasting.

Within the Private Equity (PE) market, the event of a private company undertaking an Initial Public Offering (IPO) is usually a very high-return one for the investors in the company. For this reason, an effective predictive model for the IPO event is considered as a valuable tool in the PE market, an endeavor in which …

2019-11-19abs ↗pdf ↗

Deep learning has achieved remarkable success in diverse applications; however, its use in solving partial differential equations (PDEs) has emerged only recently. Here, we present an overview of physics-informed neural networks (PINNs), which embed a PDE into the loss of the neural network using automatic differentiat…

2019-07-10abs ↗pdf ↗

Develops a new class of forward performance processes for investment pools.

problem Investment performance in market models with continuous semimartingale stock prices.
method Constructs a broad class of forward performance processes with power mixture initial conditions.
result Characterizes and derives properties of two-power mixture forward performance processes.

Bayesian neural networks benefit from fully marginalizing over all modes to improve generalization.

problem Bayesian neural networks suffer from multimodal posterior distributions that can lead to suboptimal generalization.
method Use appropriate Bayesian sampling tools to fully marginalize over all posterior modes.
result Training with full marginalization improves the ability of the network to reason between multiple candidate solutions.