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,657 papers · 148 categories

Trend · papers per month

125250375500 · May 202619922001200920172026
48 results for automated theorem proving

Lean Copilot uses LLMs to assist theorem proving in Lean, improving efficiency and automation.

problem Challenges in using existing neural theorem provers to prove novel theorems autonomously.
method Introduces Lean Copilot, a framework for integrating LLMs into Lean's theorem proving process.
result Lean Copilot automates 74.2% of proof steps on average, significantly improving over existing methods.

We consider the task of automated theorem proving, a key AI task. Deep learning has shown promise for training theorem provers, but there are limited human-written theorems and proofs available for supervised learning. To address this limitation, we propose to learn a neural generator that automatically synthesizes the…

2020-02-17abs ↗pdf ↗

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 ↗

INT benchmark tests theorem proving agents' ability to generalize to unseen theorems.

problem Evaluating theorem proving agents' ability to generalize to unseen theorems.
method INT benchmark based on a theorem generation and proof procedure with adjustable knobs for measuring 6 types of generalization.
result MCTS can help agents prove new theorems.

In this paper, we demonstrate how to do automated theorem proving in the presence of a large knowledge base of potential premises without learning from human proofs. We suggest an exploration mechanism that mixes in additional premises selected by a tf-idf (term frequency-inverse document frequency) based lookup in a d…

2019-05-25abs ↗pdf ↗

Unified geometric flows improve deep learning efficiency and simplify neural network topologies.

problem Improving deep learning performance and simplifying neural network structures.
method Proposes a thermodynamically coupled Ricci flow that dynamically adapts parameter space geometry to loss landscape topology, enabling automated singularity resolution and providing entanglement entropy bounds.
result Demonstrates 2.1× convergence acceleration and 63% topological simplification while maintaining O(NlogN)\mathcal{O}(N\log N) complexity, outperforming Riemannian baselines by 15.2% in few-shot accuracy.

We explore the application of automated reasoning techniques to unknot detection, a classical problem of computational topology. We adopt a two-pronged experimental approach, using a theorem prover to try to establish a positive result (i.e. that a knot is the unknot), whilst simultaneously using a model finder to try …

2014-05-16abs ↗pdf ↗

In this article, we introduce rack invariants of oriented Legendrian knots in the 3-dimensional Euclidean space endowed with the standard contact structure, which we call Legendrian racks. These invariants form a generalization of the quandle invariants of knots. These rack invariants do not result in a complete invari…

2017-06-23abs ↗pdf ↗

The paper explores IL and LVR in AMMs, identifying three regimes and the effect of fees.

problem The relationship between impermanent loss and loss-versus-rebalancing in AMMs.
method Statistical analysis, focus on fees, block times, and continuous time limit.
result Three regimes identified: identical, distinct distribution functions, and distinct averages.

Automation engineering is the task of integrating, via software, various sensors, actuators, and controls for automating a real-world process. Today, automation engineering is supported by a suite of software tools including integrated development environments (IDE), hardware configurators, compilers, and runtimes. The…

2019-09-06abs ↗pdf ↗

Automation of machine learning model development is increasingly becoming an established research area. While automated model selection and automated data pre-processing have been studied in depth, there is, however, a gap concerning automated model adaptation strategies when multiple strategies are available. Manually…

2018-12-27abs ↗pdf ↗

While artificial intelligence (AI) and other automation technologies might lead to enormous progress in healthcare, they may also have undesired consequences for people working in the field. In this interdisciplinary study, we capture empirical evidence of not only what healthcare work could be automated, but also what…

2019-10-21abs ↗pdf ↗

Paper formalizes analogy between data sets and models using Hoare logic.

problem Lack of formal criteria for transferring machine learning models between data domains.
method Formalization of analogy using first-order logic and Hoare logic, rigorous theorem proving.
result Rigorous formalization of analogy in knowledge transfer between machine learning models.

Automated machine learning (AutoML) aims to find optimal machine learning solutions automatically given a machine learning problem. It could release the burden of data scientists from the multifarious manual tuning process and enable the access of domain experts to the off-the-shelf machine learning solutions without e…

2019-07-21abs ↗pdf ↗

Automates infectious disease policy-making via inference in epidemiological models.

problem Improving policy-making for infectious diseases during pandemics.
method Performing inference in existing epidemiological models using a probabilistic programming language.
result Automated inference leads to better disease progression outcomes and policy prescriptions.

New formula identifies and quantifies costs for automated market makers.

problem Adverse selection costs faced by liquidity providers in automated market makers.
method Derives a Black-Scholes-like formula for AMMs and identifies loss-versus-rebalancing cost.
result Closed-form expressions for LVR applicable to all automated market makers.

This paper improves transportation efficiency by teaching automated vehicles to cooperate.

problem Improving efficiency and safety of transportation systems with automated vehicles.
method Multi-agent graph reinforcement learning with attention mechanism.
result Automated vehicles can achieve better performance when learning to cooperate with each other.

New metric to measure liquidity position PNL, delta hedging algorithm for automated market makers.

problem Vulnerability of liquidity positions to price changes in underlying assets.
method Proposes a new metric for measuring PNL, delta hedging algorithm for various AMMs.
result New metric more accurately measures net value change due to price movement.

FedNAS automates federated learning by searching for better architectures.

problem Non-I.I.D. data makes predefined model architectures suboptimal.
method Federated Neural Architecture Search (FedNAS) for collaborative architecture optimization.
result FedNAS searches for better architectures that outperform predefined models.

The increasing availability of large but noisy data sets with a large number of heterogeneous variables leads to the increasing interest in the automation of common tasks for data analysis. The most time-consuming part of this process is the Exploratory Data Analysis, crucial for better domain understanding, data clean…

2019-03-27abs ↗pdf ↗

Paper proposes efficient cost functions for automated market makers in DeFi.

problem Inefficient and computationally complex cost functions in DeFi.
method Proposes and analyzes constant circle/ellipse based cost functions.
result Proposed cost functions are computationally efficient and robust against attacks.

Multi-task learning (MTL) has recently contributed to learning better representations in service of various NLP tasks. MTL aims at improving the performance of a primary task, by jointly training on a secondary task. This paper introduces automated tasks, which exploit the sequential nature of the input data, as second…

2017-09-16abs ↗pdf ↗

No free lunch theorems suggest inductive biases are needed, but we show neural networks prefer low-complexity data.

problem The need for inductive biases in machine learning.
method Analysis of Kolmogorov complexity and neural network behavior on various datasets.
result Neural networks prefer low-complexity data, suggesting inductive biases are not always necessary.

Fake engagement is one of the significant problems in Online Social Networks (OSNs) which is used to increase the popularity of an account in an inorganic manner. The detection of fake engagement is crucial because it leads to loss of money for businesses, wrong audience targeting in advertising, wrong product predicti…

2019-09-13abs ↗pdf ↗

Optimizes classifiers for varying levels of automation.

problem Supervised learning models often perform worse than human experts on specific instances.
method Focuses on convex margin-based classifiers, showing the problem is NP-hard. For SVMs, the objective function is decomposed into monotone and modular components, allowing efficient algorithms to solve the problem.
result The approach demonstrates that classifiers optimized for varying levels of automation can outperform full automation and human-only models.

Smart Close-out Netting aims to automate close-out netting processes.

problem Inefficiencies in close-out netting processes for financial institutions.
method Standardisation and automation of legal and regulatory processes using a data-driven framework and controlled natural language.
result Standardisation and automation can improve close-out netting processes for prudentially regulated financial institutions.