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

Trend · papers per month

212424636848 · Jun 202019922001200920172026
48 results for Neural Program Induction

We propose the Neural Logic Machine (NLM), a neural-symbolic architecture for both inductive learning and logic reasoning. NLMs exploit the power of both neural networks---as function approximators, and logic programming---as a symbolic processor for objects with properties, relations, logic connectives, and quantifier…

2019-04-26abs ↗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 ↗

Machine learning refactors knowledge to improve learning efficiency.

problem Inductive program synthesis efficiency through knowledge restructuring.
method Introduces Knorf, a system that refactors knowledge bases using constraint optimization.
result Learning from refactored knowledge improves predictive accuracy fourfold and reduces learning time by half.

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.

This abstract extends on the previous work (arXiv:1407.2646, arXiv:1606.00075) on program induction using probabilistic programming. It describes possible further steps to extend that work, such that, ultimately, automatic probabilistic program synthesis can generalise over any reasonable set of inputs and outputs, in …

2018-10-02abs ↗pdf ↗

DILP improves fraud detection explainability without significant performance boost.

problem Improving fraud detection explainability in machine learning.
method Differentiable Inductive Logic Programming (DILP) for fraud detection with data curation.
result DILP provides comparable results to traditional methods but lacks significant advantage.

Learning a natural language interface for database tables is a challenging task that involves deep language understanding and multi-step reasoning. The task is often approached by mapping natural language queries to logical forms or programs that provide the desired response when executed on the database. To our knowle…

2016-11-28abs ↗pdf ↗

Machine learning has made major advances in categorizing objects in images, yet the best algorithms miss important aspects of how people learn and think about categories. People can learn richer concepts from fewer examples, including causal models that explain how members of a category are formed. Here, we explore the…

2019-04-17abs ↗pdf ↗

Characterizes inductive bias in multi-channel linear CNNs with bounded weight norm.

problem Understanding the inductive bias in multi-channel linear convolutional networks.
method Function space characterization and empirical testing of gradient descent.
result The inductive bias depends on the number of output channels for multi-channel inputs but not for single-channel inputs.

Paper proposes a novel RRL framework that learns from images and incorporates expert knowledge.

problem Lack of effective methods to incorporate expert background knowledge and learn from non-relational data in RRL.
method Differentiable Inductive Logic Programming (ILP) for learning relational information from images and incorporating expert knowledge.
result Efficacy demonstrated on various environments and datasets, showing improved learning and generalization.

A new decision tree induction method using MIP for faster optimization.

problem Optimizing decision tree split rules for better classification performance.
method Mixed-integer programming (MIP) for Gini reduction maximization, efficient search algorithm.
result bsnsing trees outperform other tree models in new case discrimination.

In iterative supervised learning algorithms it is common to reach a point in the search where no further induction seems to be possible with the available data. If the search is continued beyond this point, the risk of overfitting increases significantly. Following the recent developments in inductive semantic stochast…

2017-06-19abs ↗pdf ↗

Graph-structured data appears frequently in domains including chemistry, natural language semantics, social networks, and knowledge bases. In this work, we study feature learning techniques for graph-structured inputs. Our starting point is previous work on Graph Neural Networks (Scarselli et al., 2009), which we modif…

2015-11-17abs ↗pdf ↗

A key feature of inductive logic programming (ILP) is its ability to learn first-order programs, which are intrinsically more expressive than propositional programs. In this paper, we introduce techniques to learn higher-order programs. Specifically, we extend meta-interpretive learning (MIL) to support learning higher…

2019-07-25abs ↗pdf ↗

Study links neural network inductive bias, feature learning, and generalization on Boolean functions.

problem Understanding how neural networks learn and generalize on Boolean data.
method End-to-end analysis of depth-2 discrete fully connected networks and DNF formulas, using Monte Carlo learning.
result Predictable training dynamics and interpretable features emerge, linking inductive bias and generalization.

The recent success of natural language understanding (NLU) systems has been troubled by results highlighting the failure of these models to generalize in a systematic and robust way. In this work, we introduce a diagnostic benchmark suite, named CLUTRR, to clarify some key issues related to the robustness and systemati…

2019-08-16abs ↗pdf ↗

Strong inductive biases prevent harmless interpolation in overparameterized models.

problem Understanding the conditions under which overparameterized models can interpolate noise without overfitting.
method Theoretical analysis of high-dimensional kernel regression and deep neural networks, focusing on the role of inductive biases.
result The strength of an estimator's inductive bias determines whether interpolation is harmless or requires fitting noise for good generalization.

Model proposes neural network for continuous time dynamics with inductive biases.

problem Training neural networks for small datasets with nonlinear dynamics.
method Inductive biases on decay rates and frequencies using Koopman operator theory.
result Higher forecasting performance with single short training sequence.

This work adapts RDT for mental program construction, showing benefits and costs.

problem Applying RDT to mental programs with trade-offs between description length, error, and computational costs.
method Proposed a three-way trade-off and used simulations and partial information decomposition.
result Constructing a shared program library provides global benefits but is sensitive to curricula.

We study a formalization of the grammar induction problem that models sentences as being generated by a compound probabilistic context-free grammar. In contrast to traditional formulations which learn a single stochastic grammar, our grammar's rule probabilities are modulated by a per-sentence continuous latent variabl…

2019-06-24abs ↗pdf ↗

Study reveals how neural network architectures bias their learning based on feature directions.

problem Understanding how neural network architectures bias their learning based on feature directions.
method Defined neural anisotropy directions (NADs) to encapsulate the directional inductive bias of architectures and provided an efficient method to identify them.
result NADs characterize the features used by CNNs to discriminate between different classes for the CIFAR-10 dataset.

Study reveals biases in gradient descent for GLNs, improving neural network performance.

problem Understanding and improving the inductive biases of deep neural networks.
method Derive infinite-time training limit of gated linear networks and generalize to other networks.
result Theoretical framework captures key inductive biases of ReLU networks.

Recent work in model-agnostic explanations of black-box machine learning has demonstrated that interpretability of complex models does not have to come at the cost of accuracy or model flexibility. However, it is not clear what kind of explanations, such as linear models, decision trees, and rule lists, are the appropr…

2016-11-22abs ↗pdf ↗

New approach relaxes inductive biases of physics-inspired NNs for better performance.

problem Challenges in applying physics-inspired NNs to real-world systems.
method Examined and relaxed inductive biases of Hamiltonian NNs, improving performance on non-conservative systems.
result Improved performance on practical, non-conservative systems by relaxing inductive biases.

Extract symbolic models from deep learning with inductive biases.

problem Interpreting and discovering physical principles from deep neural networks.
method Introduce strong inductive biases in GNNs, encourage sparse latent representations, apply symbolic regression.
result Extracted symbolic equations from neural networks, including known force laws and new analytic formulas.

Graph neural networks improve combinatorial optimization by leveraging inductive bias.

problem Combinatorial optimization problems often arise from related data distributions.
method Using graph neural networks to enhance or solve combinatorial tasks.
result Graph neural networks effectively encode combinatorial and relational input.

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 ↗

Proposes a neural framework to select subsets efficiently across different models.

problem Lack of generalizability in subset selection methods for unseen architectures.
method Introduces a trainable subset selection framework, SubSelNet, that uses attention-based neural gadgets and subset samplers.
result SubSelNet generalizes across architectures and outperforms existing methods.

Synthesizing programs using example input/outputs is a classic problem in artificial intelligence. We present a method for solving Programming By Example (PBE) problems by using a neural model to guide the search of a constraint logic programming system called miniKanren. Crucially, the neural model uses miniKanren's i…

2018-09-08abs ↗pdf ↗

Automated synthesis of inductive invariants is an important problem in software verification. Once all the invariants have been specified, software verification reduces to checking of verification conditions. Although static analyses to infer invariants have been studied for over forty years, recent years have seen a f…

2019-11-26abs ↗pdf ↗

Recent work has shown how to embed differentiable optimization problems (that is, problems whose solutions can be backpropagated through) as layers within deep learning architectures. This method provides a useful inductive bias for certain problems, but existing software for differentiable optimization layers is rigid…

2019-10-28abs ↗pdf ↗

Framework optimizes battery storage for markets by separating long-term degradation from short-term market dynamics.

problem Intractable computation due to timescale mismatch between battery degradation and market dynamics.
method Approximate dynamic programming with value function approximation and pseudo-time encoding.
result Policy outperforms benchmarks in real-time market scenarios.