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

316293124 · Jun 202019922001200920172026
48 results for Github Copilot

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 model GitHub interactions as a temporal knowledge graph for software engineering questions.

problem Insufficient performance of existing temporal models on extrapolated queries and time prediction.
method Introduced an extension to current temporal models using relative temporal information.
result Improved performance on extrapolated queries and time prediction.

We present multi-point optimization: an optimization technique that allows to train several models simultaneously without the need to keep the parameters of each one individually. The proposed method is used for a thorough empirical analysis of the loss landscape of neural networks. By extensive experiments on FashionM…

2019-10-09abs ↗pdf ↗

Bayesian methods have been successfully applied to sparsify weights of neural networks and to remove structure units from the networks, e. g. neurons. We apply and further develop this approach for gated recurrent architectures. Specifically, in addition to sparsification of individual weights and neurons, we propose t…

2018-12-12abs ↗pdf ↗

In this paper, we introduce ChainerRL, an open-source deep reinforcement learning (DRL) library built using Python and the Chainer deep learning framework. ChainerRL implements a comprehensive set of DRL algorithms and techniques drawn from state-of-the-art research in the field. To foster reproducible research, and fo…

2019-12-09abs ↗pdf ↗

Independent Component Analysis (ICA) aims to find a coordinate system in which the components of the data are independent. In this paper we construct a new nonlinear ICA model, called WICA, which obtains better and more stable results than other algorithms. A crucial tool is given by a new efficient method of verifying…

2020-01-13abs ↗pdf ↗

Fast-vollib offers high-performance option pricing and IV computation.

problem Efficiently pricing and computing implied volatility for financial models.
method Open-source Python library with PyTorch, JAX, and CUDA backends, implementing Halley and LBR algorithms.
result High-performance option pricing and IV computation with vectorized implementations.

In natural language processing, a lot of the tasks are successfully solved with recurrent neural networks, but such models have a huge number of parameters. The majority of these parameters are often concentrated in the embedding layer, which size grows proportionally to the vocabulary length. We propose a Bayesian spa…

2018-10-25abs ↗pdf ↗

PyODDS is an end-to end Python system for outlier detection with database support. PyODDS provides outlier detection algorithms which meet the demands for users in different fields, w/wo data science or machine learning background. PyODDS gives the ability to execute machine learning algorithms in-database without movi…

2019-10-07abs ↗pdf ↗

A brief introduction to exterior differential systems for graduate students familiar with manifolds and differential forms. For complete files, see https://github.com/Ben-McKay/introduction-to-exterior-differential-systems

2017-06-29abs ↗pdf ↗

modAL is a modular active learning framework for Python, aimed to make active learning research and practice simpler. Its distinguishing features are (i) clear and modular object oriented design (ii) full compatibility with scikit-learn models and workflows. These features make fast prototyping and easy extensibility p…

2018-05-02abs ↗pdf ↗

3DB framework tests and debugs computer vision models using photorealistic simulation.

problem Discovering vulnerabilities and understanding model decision-making in computer vision systems.
method Unified framework using photorealistic simulation to test and debug vision models.
result Insights generated by 3DB transfer to the physical world, enabling robustness analysis.

We present Breizhcrops, a novel benchmark dataset for the supervised classification of field crops from satellite time series. We aggregated label data and Sentinel-2 top-of-atmosphere as well as bottom-of-atmosphere time series in the region of Brittany (Breizh in local language), north-east France. We compare seven r…

2019-05-28abs ↗pdf ↗

The study of adversarial robustness has so far largely focused on perturbations bound in p-norms. However, state-of-the-art models turn out to be also vulnerable to other, more natural classes of perturbations such as translations and rotations. In this work, we thoroughly investigate the vulnerability of neural networ…

2017-12-07abs ↗pdf ↗

In this work we propose a novel self-attention mechanism model to address electricity theft detection on an imbalanced realistic dataset that presents a daily electricity consumption provided by State Grid Corporation of China. Our key contribution is the introduction of a multi-head self-attention mechanism concatenat…

2020-02-14abs ↗pdf ↗

The Variational Auto-Encoder (VAE) is one of the most used unsupervised machine learning models. But although the default choice of a Gaussian distribution for both the prior and posterior represents a mathematically convenient distribution often leading to competitive results, we show that this parameterization fails …

2018-04-03abs ↗pdf ↗

We introduce \texttt{pycobra}, a Python library devoted to ensemble learning (regression and classification) and visualisation. Its main assets are the implementation of several ensemble learning algorithms, a flexible and generic interface to compare and blend any existing machine learning algorithm available in Pytho…

2017-04-25abs ↗pdf ↗

Differentially private (DP) machine learning has recently become popular. The privacy loss of DP algorithms is commonly reported using (ε,δ)(\varepsilon,δ)-DP. In this paper, we propose a numerical accountant for evaluating the privacy loss for algorithms with continuous one dimensional output. This accountant can be appl…

2019-06-07abs ↗pdf ↗

SignSGD improves distributed learning by tolerating faulty devices, including Byzantine adversaries.

problem Faulty devices, including Byzantine adversaries, disrupt convergence in distributed learning.
method Developed SignSGD from SGD, proving its robustness to Byzantine adversaries with upper bound convergence rate.
result SignSGD converges in the presence of Byzantine adversaries, providing a fault-tolerant solution.

DHGAK aligns substructures for better graph kernel performance.

problem Limited performance of traditional graph kernels due to missing substructure similarities.
method Hierarchically aligns relational substructures in deep embedding space, assigning same feature maps in RKHS.
result DHGAK outperforms state-of-the-art graph kernels on various benchmarks.

This work optimizes alignment and uniformity of features on a hypersphere for better downstream performance.

problem Improving the performance of contrastive representation learning.
method Identifying and optimizing alignment and uniformity of features on a hypersphere.
result Directly optimizing alignment and uniformity leads to comparable or better performance than contrastive learning.

Survey of weak form's role in equation learning, parameter estimation, and coarse graining.

problem Noise robustness, accuracy, and computational efficiency in weak form applications.
method Survey and recent developments in weak form versions of equation learning, parameter estimation, and coarse graining.
result Surprising noise robustness, accuracy, and computational efficiency in weak form applications.

A distributed bootstrap method for high-dimensional data reduces communication rounds efficiently.

problem Simultaneous inference on massive, high-dimensional data stored across many machines.
method Distributed bootstrap based on de-biased lasso with efficient cross-validation tuning.
result Theoretical lower bound on communication rounds τminτ_{\min} for statistical accuracy and efficiency.

ParaMonte simplifies Monte Carlo simulations for various scientific fields.

problem Efficiently performing Monte Carlo simulations for complex models.
method Unified, high-performance, parallelized library for C, C++, Fortran.
result Automates and streamlines Monte Carlo sampling for arbitrary-dimensional functions.

Boolean tensor decomposition approximates data of multi-way binary relationships as product of interpretable low-rank binary factors, following the rules of Boolean algebra. Here, we present its first probabilistic treatment. We facilitate scalable sampling-based posterior inference by exploitation of the combinatorial…

2018-05-11abs ↗pdf ↗

A new method, Count-MORL, improves offline reinforcement learning by using state-action frequency.

problem Improving offline reinforcement learning performance.
method Integrates count-based conservatism into model-based offline reinforcement learning.
result The learned policy is near-optimal and outperforms existing methods.