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

25.0%50.0%75.0%100.0% · Jun 199319922001200920172026
48 results for Zero-knowledge proofs

Confidential Guardian prevents model abstention from being used to discriminate.

problem Dishonest institutions can exploit machine learning model abstention to unfairly deny services.
method Confidential Guardian uses zero-knowledge proofs to verify model confidence and detect suppression.
result Confidential Guardian effectively prevents the misuse of cautious predictions.

A digital euro protocol offers complete privacy and offline transactions using Groth-Sahai proofs.

problem Fragile digital payment solutions with privacy and offline transaction issues.
method Design and implementation of a Central Bank Digital Currency (CBDC) using Groth-Sahai zero-knowledge proofs.
result Complete privacy and offline transaction capability with retroactive double-spending detection.

PHAZE framework uses zkML and hashing for fast, verifiable LHC trigger decisions.

problem Inefficient inference on large machine learning models for LHC trigger performance.
method Cryptographic techniques like hashing and zkML for low latency, certifiable inference.
result Achieves nanosecond-order latency for LHC triggers, enabling dynamic low-level triggers.

A scalable protocol for federated averaging with privacy and correctness guarantees.

problem Privacy and correctness in federated learning from multiple parties.
method Scalable protocol using correlated and independent Gaussian noise, analyzed for differential privacy and graph topology.
result Nearly matches trusted curator model's utility with minimal communication.

Polynomial inequalities lie at the heart of many mathematical disciplines. In this paper, we consider the fundamental computational task of automatically searching for proofs of polynomial inequalities. We adopt the framework of semi-algebraic proof systems that manipulate polynomial inequalities via elementary inferen…

2019-06-04abs ↗pdf ↗

The Goldman-Parker Conjecture classifies the complex hyperbolic C-reflection ideal triangle groups up to discreteness. We proved the Goldman-Parker Conjecture in [Ann. of Math. 153 (2001) 533--598] using a rigorous computer-assisted proof. In this paper we give a new and improved proof of the Goldman-Parker Conjecture.…

2005-08-11abs ↗pdf ↗

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.

Humans prove theorems by relying on substantial high-level reasoning and problem-specific insights. Proof assistants offer a formalism that resembles human mathematical reasoning, representing theorems in higher-order logic and proofs as high-level tactics. However, human experts have to construct proofs manually by en…

2019-05-21abs ↗pdf ↗

We present a formal proof in Lean of probably approximately correct (PAC) learnability of the concept class of decision stumps. This classic result in machine learning theory derives a bound on error probabilities for a simple type of classifier. Though such a proof appears simple on paper, analytic and measure-theoret…

2019-11-01abs ↗pdf ↗

We provide yet another proof of the existence of calibrated forecasters; it has two merits. First, it is valid for an arbitrary finite number of outcomes. Second, it is short and simple and it follows from a direct application of Blackwell's approachability theorem to carefully chosen vector-valued payoff function and …

2009-12-18abs ↗pdf ↗

After surveying existing proofs that every closed, orientable 3-manifold is parallelizable, we give three proofs using minimal background. In particular, our proofs use neither spin structures nor the theory of Stiefel-Whitney classes.

2018-06-13abs ↗pdf ↗

Corollary 2.3 in our paper "A geometric proof of the Karpelevich-Mostow theorem", Bull. Lond. Math. Soc. 41 (2009), no. 4, 634-638, is false. Here we give a counterexample and show how to avoid the use of this corollary to give a simpler proof of Karpelevich-Mostow theorem. We also include a short discussion of the ori…

2011-04-05abs ↗pdf ↗

This note (originally from 2015) provides a proof of a 1985 conjecture of Montiel and Ros concerning the conformal volume of tori. This updated version adds a proof of the claim made in Remark 5 about the value of the conformal volume of tori in the cases not covered by the conjecture of Montiel and Ros. Originally, I …

2015-07-06abs ↗pdf ↗