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

4386129172 · Jun 202019922001200920172026
48 results for question chains

PyFi uses adversarial agents to train VLMs on financial image understanding.

problem Training VLMs to understand complex financial questions.
method PyFi-600K dataset and adversarial MCTS mechanism.
result Fine-tuned VLMs improve by 19.52% and 8.06% on financial question accuracy.

Non-negative curvature affects Markov chains' mixing and expansion properties.

problem Understanding the behavior of Markov chains with non-negative curvature.
method Analyzing conductance, displacement, and cutoff phenomenon in sparse Markov chains.
result Non-negatively curved Markov chains exhibit specific, non-standard behavior in terms of mixing and expansion.

This thesis is divided into three parts. In the first part, we give an introduction to J. Harrison's theory of differential chains. In the second part, we apply these tools to generalize the Cauchy theorems in complex analysis. Instead of requiring a piecewise smooth path over which to integrate, we can now do so over …

2010-12-26abs ↗pdf ↗

The paper proves inequalities for Steklov eigenvalues on finite graphs.

problem Eigenvalues of Laplacians for reversible Markov chains and Steklov eigenvalues.
method Generalized Cheeger inequalities, convergence results, and resolvent convergence.
result Sharp estimate for the first non-trivial Steklov eigenvalue.

Markov chains and diffusion processes are indispensable tools in machine learning and statistics that are used for inference, sampling, and modeling. With the growth of large-scale datasets, the computational cost associated with simulating these stochastic processes can be considerable, and many algorithms have been p…

2016-05-20abs ↗pdf ↗

Deep networks are shown to be equivalent to a new type of kernel chain.

problem Identifying an appropriate function space for deep neural networks.
method Extending Reproducing Kernel Banach Spaces (RKBS) to chain RKBS (cRKBS), which composes kernels rather than functions.
result Any deep neural network function is a neural cRKBS function, and conversely, any neural cRKBS function corresponds to a deep neural network.

The paper shows how to answer future and past questions from high-dimensional time series data.

problem Challenges in answering probabilistic inference questions from high-dimensional time series data.
method Temporal contrastive learning to learn Gaussian representations that enable compact closed-form solutions.
result Representations learned via contrastive learning follow a Gauss-Markov chain, enabling efficient inference and planning.

Markov chain Monte Carlo (MCMC) methods are widely used in machine learning. One of the major problems with MCMC is the question of how to design chains that mix fast over the whole state space; in particular, how to select the parameters of an MCMC algorithm. Here we take a different approach and, similarly to paralle…

2018-06-11abs ↗pdf ↗

The paper studies how quickly samples from Langevin dynamics become independent.

problem Understanding the dependence between samples along Langevin dynamics and related algorithms.
method Measures dependence via ΦΦ-mutual information and proves strong data processing inequalities.
result The ΦΦ-mutual information between samples decreases exponentially to zero.

FinML-Chain integrates blockchain data for financial machine learning.

problem Challenges in financial machine learning, including missing data, lack of transparency, and incompatible data sources.
method Blockchain technology integrated with machine learning techniques to address financial market challenges.
result Framework generates datasets for analyzing economic mechanisms, advancing financial research.

The chains studied in this paper generalize Chern-Moser chains for CR structures. They form a distinguished family of one dimensional submanifolds in manifolds endowed with a parabolic contact structure. Both the parabolic contact structure and the system of chains can be equivalently encoded as Cartan geometries (of d…

2005-04-22abs ↗pdf ↗

This is an expository article on the theory of Kuranishi structure and is based on a series of pdf files we uploaded for the discussion of the google group named `Kuranishi' (with its administrator H. Hofer). There we replied to several questions concerning Kuranishi structure raised by K. Wehrheim. At this stage we su…

2012-09-20abs ↗pdf ↗

A new multi-phase approach improves supply chain forecasting accuracy.

problem Improving forecast accuracy for hierarchical supply chain demands.
method Independent child-level forecasting followed by parent-level estimation.
result 82-90% improvement in forecast accuracy compared to traditional methods.

Study non-negative curvature Markov chains, proving entropy contraction.

problem Prove entropy contraction for Markov chains with non-negative curvature.
method Prove 1-step contraction in Wasserstein distance implies 1-step contraction in relative entropy.
result Prove MLSI with constant equal to minimal rate increment for mean-field zero-range process.

A new stopping rule based on E-values helps efficiently use sampling in Bayesian Deep Ensembles.

problem How long should sampling continue in Bayesian Deep Ensembles to yield significant improvements?
method Formulated as a sequential anytime-valid hypothesis test, using E-values to decide when to stop sampling.
result Only a fraction of the full-chain budget is often required for significant improvements.

Proteins are linear molecular chains that often fold to function. The topology of folding is widely believed to define its properties and function, and knot theory has been applied to study protein structure and its implications. More that 97% of proteins are, however, classified as unknots when intra-chain interaction…

2019-12-19abs ↗pdf ↗

We describe a new class of learning models called memory networks. Memory networks reason with inference components combined with a long-term memory component; they learn how to use these jointly. The long-term memory can be read and written to, with the goal of using it for prediction. We investigate these models in t…

2014-10-15abs ↗pdf ↗

We study two--generated subgroups f,g<Homeo+(I)\langle f,g\rangle<\mathrm{Homeo}^+(I) such that f2,g2\langle f^2,g^2\rangle is isomorphic to Thompson's group FF, and such that the supports of ff and gg form a chain of two intervals. We show that this class contains uncountably many isomorphism types. These include examples with n…

2017-04-11abs ↗pdf ↗

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.

How does supply uncertainty affect the structure of supply chain networks? To answer this question we consider a setting where retailers and suppliers must establish a costly relationship with each other prior to engaging in trade. Suppliers, with uncertain yield, announce wholesale prices, while retailers must decide …

2019-07-20abs ↗pdf ↗

This paper studies transformer learning dynamics and initialization.

problem Understanding how transformers learn Markov chains and the role of initialization.
method First-order Markov chains and single-layer transformers, proving learning dynamics and conditions for convergence.
result Transformer parameters can converge to global or local minima based on initialization and Markovian data properties.

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.

Bayesian neural networks show complex posterior distributions that HMC can capture effectively.

problem Understanding and approximating the high-dimensional, non-convex posterior of Bayesian neural networks.
method Full-batch Hamiltonian Monte Carlo (HMC) on modern architectures.
result HMC provides a robust and comparable representation of the BNN posterior, with significant performance gains over standard training and deep ensembles.

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.

Transformers can generalize to a large task family with only a few demonstrations.

problem Can learning from a small set of tasks generalize to a large task family?
method Investigating autoregressive compositional structure where each task is a composition of TT operations, each from a finite family of DD subtasks.
result Transformers can generalize to DTD^T tasks with only O~(D)\widetilde{O}(D) demonstrations.

Study finds on-chain data can proxy off-chain cryptocurrency pricing.

problem Develop methods to proxy off-chain cryptocurrency pricing using on-chain data.
method Graphical models, mutual information, and ensemble machine learning.
result A significant amount of pricing information is contained in on-chain data, but precise prices are hard to recover except on short time scales.

TIM framework uses LLMs and domain experts to infer DeFi user transaction intents.

problem Challenges in understanding user intent in DeFi transactions due to complex interactions and opaque logs.
method TIM framework leverages a DeFi intent taxonomy, multi-agent LLM system, and a Meta-Level Planner.
result TIM significantly outperforms existing methods in inferring user transaction intents.

All parabolic geometries, i.e. Cartan geometries with homogeneous model a real generalized flag manifold, admit highly interesting classes of distinguished curves. The geodesics of a projective class of connections on a manifold, conformal circles on conformal Riemannian manifolds, and Chern--Moser chains on CR--manifo…

2003-08-06abs ↗pdf ↗

Ranking is a key aspect of many applications, such as information retrieval, question answering, ad placement and recommender systems. Learning to rank has the goal of estimating a ranking model automatically from training data. In practical settings, the task often reduces to estimating a rank functional of an object …

2014-07-23abs ↗pdf ↗

C-IP improves LLMs' query selection for interactive tasks by estimating uncertainty robustly.

problem Minimizing the number of queries for interactive LLMs.
method Conformal Information Pursuit (C-IP) using conformal prediction sets.
result C-IP achieves better predictive performance and shorter query-answer chains.

Reduces identity testing of reversible Markov chains to simpler symmetric chain tests.

problem Testing identity of reversible Markov chains from a single trajectory.
method Using lumping-congruent Markov embeddings, the problem is simplified to testing symmetric chains over a larger state space.
result Achieves state-of-the-art sample complexity for identity testing.