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

Trend · papers per month

6.3%12.5%18.8%25.0% · Apr 199319922001200920172026
48 results for software programs

funcGNN uses graph neural networks to estimate program similarity efficiently.

problem Estimating accurate program similarity for software engineering tasks.
method funcGNN trains on labeled CFG pairs to predict GED between unseen programs using effective embedding vectors.
result funcGNN achieves lower error rate (0.00194) and is 23 times faster than traditional methods.

TreeCaps improves code comprehension for software developers.

problem Processing code efficiently for software developers.
method Tree-based capsule networks for capturing code syntactical structures and dependencies.
result TreeCaps outperforms other approaches in classifying program functionalities.

We propose design guidelines for a probabilistic programming facility suitable for deployment as a part of a production software system. As a reference implementation, we introduce Infergo, a probabilistic programming facility for Go, a modern programming language of choice for server-side software development. We argu…

2019-06-20abs ↗pdf ↗

TomOpt optimizes muon detector designs using differentiable programming.

problem Designing efficient particle detectors for muon tomography.
method Differentiable programming for muon interaction modeling, inference, and optimisation.
result Demonstrated end-to-end differentiable and inference-aware optimisation of particle physics instruments.

Automatic program repair holds the potential of dramatically improving the productivity of programmers during the software development process and correctness of software in general. Recent advances in machine learning, deep learning, and NLP have rekindled the hope to eventually fully automate the process of repairing…

2019-06-24abs ↗pdf ↗

Probabilistic programming allows specification of probabilistic models in a declarative manner. Recently, several new software systems and languages for probabilistic programming have been developed on the basis of newly developed and improved methods for approximate inference in probabilistic models. In this contribut…

2013-06-02abs ↗pdf ↗

In this paper, we propose a new feature extraction technique for program execution logs. First, we automatically extract complex patterns from a program's behavior graph. Then, we embed these patterns into a continuous space by training an autoencoder. We evaluate the proposed features on a real-world malicious softwar…

2018-04-10abs ↗pdf ↗

EvaSylv software evaluates forest management with natural risk considerations.

problem Evaluating forest management under increased natural risk due to climate change.
method User-friendly software simulates forest management scenarios, integrating natural risk using a Poisson process and Faustmann approach.
result Software optimizes forest management criteria like Faustmann value and Averaged yield value.

d3p package enables efficient Bayesian inference with differential privacy.

problem Efficiently performing Bayesian inference under differential privacy constraints.
method Differentially private variational inference for flexible probabilistic models.
result Achieves significant speed-up in runtime for complex models.

Deep neural networks have been increasingly used in software engineering and program analysis tasks. They usually take a program and make some predictions about it, e.g., bug prediction. We call these models neural program analyzers. The reliability of neural programs can impact the reliability of the encompassing anal…

2019-08-25abs ↗pdf ↗

The problem of automatic software generation is known as Machine Programming. In this work, we propose a framework based on genetic algorithms to solve this problem. Although genetic algorithms have been used successfully for many problems, one criticism is that hand-crafting its fitness function, the test that aims to…

2019-08-22abs ↗pdf ↗

Concolic testing combines program execution and symbolic analysis to explore the execution paths of a software program. This paper presents the first concolic testing approach for Deep Neural Networks (DNNs). More specifically, we formalise coverage criteria for DNNs that have been studied in the literature, and then d…

2018-04-30abs ↗pdf ↗

We study the performance of stochastically trained deep neural networks (DNNs) whose synaptic weights are implemented using emerging memristive devices that exhibit limited dynamic range, resolution, and variability in their programming characteristics. We show that a key device parameter to optimize the learning effic…

2017-11-09abs ↗pdf ↗

In this short article I introduce the knotR package, which creates two dimensional knot diagrams optimized for visual appearance using the R programming language. The knotR package is a systematic R-centric suite of software for the creation of production-quality artwork of knot diagrams, released under GPL2.

2016-10-11abs ↗pdf ↗

We present the mathematical background of a software package that computes triangulations of mapping tori of surface homeomorphisms, suitable for Jeff Weeks's program SnapPea. It consists of two programs. jmt computes triangulations and prints them in a human-readable format. jsnap converts this format into SnapPea's t…

2000-12-01abs ↗pdf ↗

Neural program embedding can be helpful in analyzing large software, a task that is challenging for traditional logic-based program analyses due to their limited scalability. A key focus of recent machine-learning advances in this area is on modeling program semantics instead of just syntax. Unfortunately evaluating su…

2019-05-27abs ↗pdf ↗

Despite the tremendous advances that have been made in the last decade on developing useful machine-learning applications, their wider adoption has been hindered by the lack of strong assurance guarantees that can be made about their behavior. In this paper, we consider how formal verification techniques developed for …

2019-07-16abs ↗pdf ↗

Due to its potential to improve programmer productivity and software quality, automated program repair has been an active topic of research. Newer techniques harness neural networks to learn directly from examples of buggy programs and their fixes. In this work, we consider a recently identified class of bugs called va…

2019-04-03abs ↗pdf ↗

Functional tensors unify probabilistic programming with automatic differentiation.

problem Designing probabilistic programming systems that can handle diverse inference strategies.
method Introducing functional tensors that capture benefits of tensors and continuous probability distributions.
result Functional tensors enable parallel exact inference for various modeling motifs.

We present SmartChoices, an approach to making machine learning (ML) a first class citizen in programming languages which we see as one way to lower the entrance cost to applying ML to problems in new domains. There is a growing divide in approaches to building systems: on the one hand, programming leverages human expe…

2018-10-01abs ↗pdf ↗

IReEn reveals functionality of black-box agents via iterative neural synthesis.

problem Revealing the functionality of a black-box agent without privileged information.
method Iterative refinement of candidate programs using neural program synthesis.
result The approach finds a functional equivalent program in 78% of cases, outperforming state-of-the-art.

TensorFI injects faults in TensorFlow programs to assess their reliability.

problem Ensuring reliability of machine learning systems in safety-critical domains.
method TensorFI is a flexible fault injection framework for TensorFlow applications.
result TensorFI evaluates the resilience of 12 ML programs, including autonomous vehicle DNNs.

Extends DCP framework to Hadamard manifolds for geodesically convex functions.

problem Verifying convexity in nonlinear programs on Hadamard manifolds.
method Introduces Disciplined Geodesically Convex Programming (DGCP) framework, defining compositions and transformations for geodesically convex functions.
result Allows verification of geodesic convexity for a broader range of functions, including statistical estimators and matrix-valued optimization.

Simplifies efficient estimation via automatic differentiation and probabilistic programming.

problem Constructing efficient estimators for complex statistical models.
method Automatic differentiation applied to statistical functionals, avoiding the need to derive efficient influence functions.
result Users can generate efficient estimators with minimal code, simplifying the process for non-experts.