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.

169,096 papers · 148 categories

Trend · papers per month

4896144192 · Jun 202019922001200920182026
48 results for Interactive Proofs

A study on the communication complexity of estimating correlations between variables.

problem Estimating the correlation between two sets of correlated random variables with limited communication.
method One-way interactive protocol exchanging k bits, optimizing over interaction protocol and estimator.
result Achieves optimal performance with communication complexity of 1/k, improving over naive schemes.

A new learning method for prosthetic arms without explicit rewards.

problem Learning a prosthetic arm to interact with users without explicit reward signals.
method Interaction-Grounded Learning, observing multidimensional context and feedback vectors, discovering latent reward signal.
result The algorithm can discover a latent reward signal and ground its policies for successful interaction.

Interactive game approach extracts action graphs from specialized text.

problem Action graph extraction from specialized procedural text.
method Interpreting procedural text as game instructions, using a learning agent to simulate and execute the procedure.
result Framework complements existing approaches and enables richer learning.

Surveying interactions between foliations and contact structures in 3D.

problem Understanding interactions between foliations and contact structures in 3D.
method Survey and original results based on sutured manifolds and invariants.
result An orientable, taut, balanced sutured 3-manifold is not a product if and only if it carries a contact structure with nontrivial cylindrical contact homology.

We survey some recent topics on singularities, with a focus on their connection to the minimal model program. This includes the construction and properties of dual complexes, the proof of the ACC conjecture for log canonical thresholds and the recent progress on the `local stability theory' of an arbitrary Kawamata log…

2017-12-04abs ↗pdf ↗

Mathematical framework for cooperative communication explains belief transmission.

problem Lack of understanding why cooperation enables effective belief transmission.
method Connection to optimal transport theory, deriving prior models, statistical interpretations, proofs of robustness and instability.
result Cooperative communication provably enables effective, robust belief transmission.

Study connects spectral geometry with Coulomb interactions in perforated manifolds.

problem Understanding spectral properties of perforated manifolds and their interactions.
method Optimal convergence rates for Steklov eigenvalues and expansions, derived from Green function and Coulomb-type energy.
result Identified two correction scales for Steklov eigenvalues in dimensions two and three.

Study proves interaction of three impulsive gravitational waves, showing local solution and Lipschitz continuity.

problem Interaction of three impulsive gravitational waves in Einstein vacuum equations.
method Geometric estimates and wave estimates to prove local solution and continuity.
result Local solution to Einstein vacuum equations with three impulsive gravitational waves, Lipschitz continuity.

Proposes ICE-based metric for better understanding interactions in black-box models.

problem Misleading global sensitivity metrics in black-box models due to interaction effects.
method Individual Conditional Expectation (ICE) curves to compute feature importance and interactions.
result ICE-based metric provides richer insights into feature importance and interactions.

Paper resolves open problems on sample complexity in binary hypothesis testing.

problem Open problems in distributed simple binary hypothesis testing under information constraints.
method One-shot lower bound on Bayes error, streamlined sample complexity formula, reverse data-processing inequality.
result Optimally tight sample complexity bounds for communication-constrained simple binary hypothesis testing.

Centralized exchanges influence staking behavior and decentralization in Proof of Stake blockchain ecosystems.

problem How do centralized exchanges affect staking behavior and decentralization in Proof of Stake blockchain ecosystems?
method Formulate a continuous-time mean field model of miners as validators and traders in a centralized market.
result Centralized trading activities enhance staking participation and promote decentralization through market incentives.

Graphs improve theorem proving in higher-order logic.

problem Challenges in converting higher-order logic formulas into graph-based representations.
method Used graph neural networks (GNNs) to represent and search higher-order logic.
result GNNs outperform state-of-the-art methods in higher-order theorem proving.

Improved sampling from complex distributions with reduced bias.

problem Reducing bias in high-dimensional sampling algorithms.
method Hierarchical entropy analysis to weaken assumptions and expand scope.
result Bias reduction in low-dimensional marginals scales with lower dimension, not full dimension.

We use Floer's exact triangle to study the u-map (cup product with the 4-dimensional class) in the Floer cohomology groups of admissible SO(3) bundles over closed, oriented 3-manifolds. In the case of non-trivial bundles we show that (u^2-64)^n = 0 for some positive integer n. For homology 3-spheres Y the same holds fo…

1999-03-16abs ↗pdf ↗

Formalizes vNM utility theorem using Lean 4, proving existence and uniqueness.

problem Formalizing and proving the von Neumann-Morgenstern utility theorem.
method Implement classical axioms in Lean 4, formalizing preference relations over lotteries.
result Machine-verified proofs of existence and uniqueness of utility representations.

We give a classification of toric anti-self-dual conformal structures on compact 4-orbifolds with positive Euler characteristic. Our proof is twistor theoretic: the interaction between the complex torus orbits in the twistor space and the twistor lines induces meromorphic data, which we use to recover the conformal str…

2008-05-15abs ↗pdf ↗

Symmetric functions learn better with strategic initial conditions.

problem Understanding how to improve learning efficiency for symmetric functions in neural networks.
method Investigates the impact of initial conditions on SGD training for symmetric functions in neural networks with one hidden layer.
result Strategic initial conditions can lead to efficient generalization guarantees for learning symmetric functions.

Deep neural networks tackle high-dimensional nonparametric interaction models.

problem Estimating structured regression functions in high-dimensional data.
method Analyze kthk^{th} order nonparametric interaction models in growing and high dimensions, introducing debiasing techniques.
result Debiased deep neural networks achieve optimal rates of convergence in both growing and high dimensions.

New proof improves differential privacy guarantees for adaptive data analysis.

problem Ensuring accuracy of statistical queries in adaptive data analysis.
method Elementary proof of transfer theorem using posterior distributions and resampling.
result Better concrete bounds on accuracy out-of-sample for differential privacy mechanisms.

LeanDojo removes barriers to theorem proving with open-source tools and data.

problem Difficulty in reproducing and building on existing theorem proving methods.
method Introduces LeanDojo, an open-source Lean playground with toolkits, data, models, and benchmarks.
result ReProver, an LLM-based prover augmented with retrieval, outperforms non-retrieval baselines and GPT-4.

We consider systems of diffusion processes ("particles") interacting through their ranks (also referred to as "rank-based models" in the mathematical finance literature). We show that, as the number of particles becomes large, the process of fluctuations of the empirical cumulative distribution functions converges to t…

2016-08-02abs ↗pdf ↗

IFM improves recommender systems by learning flexible feature interactions.

problem Dealing with feature interactions in recommender systems can degrade performance.
method Introduces Interaction-Aware Mechanism (IAM) to learn feature and field interactions.
result Improves performance on two well-known datasets compared to state-of-the-art methods.

We study systems of Brownian particles on the real line, which interact by splitting the local times of collisions among themselves in an asymmetric manner. We prove the strong existence and uniqueness of such processes and identify them with the collections of ordered processes in a Brownian particle system, in which …

2012-09-30abs ↗pdf ↗

A robot assists a human in a bandit task to learn and improve performance.

problem Learning preferences in humans when they are also learning.
method Introduces assistive multi-armed bandit, where a robot helps a human maximize cumulative reward.
result Human performance can be better when effectively communicating observed rewards to the robot, not just by learning optimally.

We show that the emerging field of discrete differential geometry can be usefully brought to bear on crystallization problems. In particular, we give a simplified proof of the Heitmann-Radin crystallization theorem (R. C. Heitmann, C. Radin, J. Stat. Phys. 22, 281-287, 1980), which concerns a system of NN identical at…

2016-04-29abs ↗pdf ↗