ProGraML uses graph-based machine learning to improve program optimization and analysis.
problem Improving program optimization and analysis with machine learning.
method Low-level, language agnostic graph representation and message passing neural networks.
result ProGraML achieves an average 94.0 F1 score on a benchmark dataset, significantly outperforming state-of-the-art approaches.
Multimodal deep learning improves flaw detection in software programs.
problem Current flaw detection relies on single software representations.
method Adapted multimodal deep learning models for flaw detection.
result Multimodal models outperform traditional deep learning models.
TensorFlow Probability introduces JointDistributions for probabilistic programming.
problem Specifying models in probabilistic programming languages.
method Declarative representations of directed graphical models.
result JointDistributions for TensorFlow Probability.
Introduces Motion Programs for better video analysis of human motion.
problem Current video analysis focuses on raw pixels or keypoints, missing higher-level motion primitives.
method Introduces Motion Programs as a neuro-symbolic representation of motions as a composition of high-level primitives.
result Motion Programs accurately describe diverse human motions and improve downstream tasks.
New IT representation improves symbolic regression approximations.
problem Finding better approximations to real-world data sets.
method Evolutionary Algorithm with IT representation using only mutation.
result IT representation finds better approximations than traditional methods.
NP-HMC extends HMC for nonparametric models in probabilistic programming.
problem Inference for nonparametric models in probabilistic programming.
method Introduces NP-HMC, a generalization of HMC for nonparametric models using tree representable functions.
result Empirically shows significant performance improvements over existing approaches.
Bin2vec learns executable program representations for security tasks.
problem Manual rule and heuristic definition for binary program analysis is tedious and time-consuming.
method Bin2vec uses Graph Convolutional Networks (GCN) on computational program graphs.
result Improvement over state-of-the-art methods for binary analysis tasks.
Myia compiler optimizes ML models with efficient AD for array programming.
problem Efficient automatic differentiation for array programming in ML.
method Introduces a new graph-based IR that supports function calls, higher-order functions, and recursion.
result Myia compiler enables efficient AD using source transformation without a tape, supporting higher-order derivatives.
PG-IM uses neural-symbolic programs to manipulate images.
problem Creating holistic image representations and manipulations.
method PG-IM detects patterns, induces symbolic programs, and manipulates images using a neural network.
result PG-IM learns from a single image and achieves superior performance.
MORL uses program synthesis to improve reinforcement learning policies.
problem Difficult to interpret and impose constraints on learned policies from black-box neural networks.
method Iterative framework combining program synthesis and behavior cloning.
result Programmatic representation allows for high-level modifications leading to improved learning.
Forward inference techniques such as sequential Monte Carlo and particle Markov chain Monte Carlo for probabilistic programming can be implemented in any programming language by creative use of standardized operating system functionality including processes, forking, mutexes, and shared memory. Exploiting this we have …
With the recent success of embeddings in natural language processing, research has been conducted into applying similar methods to code analysis. Most works attempt to process the code directly or use a syntactic tree representation, treating it like sentences written in a natural language. However, none of the existin…
BPI models 2D patterns on multiple planes and 3D scene from a single image.
problem Understanding and editing images with multiple 2D planes and 3D scene from a single image.
method Box Program Induction (BPI) with neural networks and search-based algorithm.
result Holistic, structured scene representation enables 3D-aware image editing.
Neural model guides PBE problem solving in programming.
problem Synthesizing programs from example inputs/outputs.
method Uses a neural model to guide miniKanren's constraint logic programming system.
result Synthesizes programs faster and generalizes to larger problems.
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.
SOC-ICNN expands neural network representational capacity by using conic optimization.
problem Restrictive representational capacity of ReLU-based ICNNs.
method Proposes SOC-ICNN architecture that uses Second-Order Cone Programming.
result SOC-ICNN strictly expands representational space without increasing complexity.
With the help of a new program, we do computations concerning the Witten-Reshetikhin-Turaev representations of mapping class groups. In particular we distinguish some mutant fibered knots. The program can be downloaded from http://www.geometrie.ch/TQFT
Hybrid approach combines ASTs and deep learning for PowerShell malware detection.
problem Detecting malicious PowerShell scripts effectively.
method Combining static program analysis (ASTs) with deep learning.
result Preliminary results show promising classification of PowerShell scripts by family type.
Unified framework for learning flexible probabilistic programs using DPP and PAC-Bayes bounds.
problem Learning and generalizing from complex probabilistic models.
method Unified DPP representation and PAC-Bayes bounds for stochastic programs.
result Improved performance and generalization prediction using flexible DPP model representations and learned complexity measures.
Paper introduces a new framework combining deep learning and logic for relational data.
problem Scalability and flexibility of deep learning methods for relational data.
method Combines auto-encoding principle with first-order logic and logic programs.
result Latent representations are more accurate, flexible, and interpretable.
Paper tackles learning probabilistic logic programs for continuous data.
problem Learning meaningful symbolic representations from continuous data.
method Leverages piecewise polynomial function approximation theory for density function learning.
result First steps towards inducing probabilistic logic programs for continuous data.
Zoetrope Genetic Programming improves symbolic regression performance.
problem Evolutionary symbolic regression for complex mathematical expressions.
method Zoetropic representation, repeated fusion operations, linear combination, crossover, mutation, selection.
result Zoetrope Genetic Programming achieves state-of-the-art performance and low computational time.
This article presents the use of Answer Set Programming (ASP) to mine sequential patterns. ASP is a high-level declarative logic programming paradigm for high level encoding combinatorial and optimization problem solving as well as knowledge representation and reasoning. Thus, ASP is a good candidate for implementing p…
MatchGNet detects malware by learning program behavior graphs.
problem Malware evasion through obfuscation and high false positives in traditional detection methods.
method Heterogeneous Graph Matching Network model that learns graph representation and similarity metrics.
result MatchGNet reduces false positives by 50% while maintaining zero false negatives.
DeepHGNN detects program identity changes using system behaviors.
problem Detecting program identity changes to prevent malware.
method Attentional heterogeneous graph neural network (DeepHGNN) for graph classification.
result DeepHGNN effectively identifies program identities across various metrics.
New method for efficient probabilistic inference using masked language modeling.
problem Efficient posterior inference in probabilistic programs with many hyper-parameters.
method Formulate inference as masked language modeling, train a neural network to unmask random values.
result Foundation posterior for zero-shot inference and fine-tuning across a range of programs.
P3I learns holistic scene representations from a single image.
problem Inferring camera poses, object locations, and global scene structures from a single image.
method Combines search-based and gradient-based algorithms.
result P3I outperforms baselines on various image manipulation tasks.
New approach uses neural networks to learn program structure and parameters.
problem Learning programs and their structure efficiently.
method Free category prior over programs, end-to-end learning of structure and parameters.
result Neural networks can serve as primitives in probabilistic programs.
Ansor generates high-performance tensor programs for deep learning.
problem Generating high-performance tensor programs for deep learning on various hardware platforms is challenging.
method Ansor uses a hierarchical representation of the search space, sampling programs, and evolutionary search with a learned cost model to find high-performance programs.
result Ansor improves deep neural network execution performance up to 3.8x on Intel CPU, 2.6x on ARM CPU, and 1.7x on NVIDIA GPU.
We propose Edward, a Turing-complete probabilistic programming language. Edward defines two compositional representations---random variables and inference. By treating inference as a first class citizen, on a par with modeling, we show that probabilistic programming can be as flexible and computationally efficient as t…
We build deep RL agents that execute declarative programs expressed in formal language. The agents learn to ground the terms in this language in their environment, and can generalize their behavior at test time to execute new programs that refer to objects that were not referenced during training. The agents develop di…
We present a neurosymbolic framework for the lifelong learning of algorithmic tasks that mix perception and procedural reasoning. Reusing high-level concepts across domains and learning complex procedures are key challenges in lifelong learning. We show that a program synthesis approach that combines gradient descent w…
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.
Genetic Programming constructs features for physics experiments, improving classification accuracy.
problem Lack of interpretable feature construction for experimental physics.
method Combining Genetic Programming with dimensional consistency constraints.
result Constructed features improve classification accuracy by a significant margin.
New method computes optimal fairness-performance trade-off without complex models.
problem Intrinsic trade-off between fairness and classifier performance.
method Computes optimal Pareto front without training complex models.
result Optimal fair representations have useful structural properties enabling efficient computation.
Contrastive Code Representation Learning improves code summarization and type inference.
problem Code representations are sensitive to edits, hindering downstream semantic understanding tasks.
method ContraCode: a contrastive pre-training task that learns code functionality.
result Contrastive pre-training improves code summarization and type inference accuracy.
Extends particle classification to curved space-times using groupoids.
problem Classifying elementary particles in curved space-time.
method Developed a new definition of elementary particles as irreducible projective representations of kinematical groupoids, extending Wigner's program.
result Classification of elementary particles valid for a wide range of space-times, including new massless particles in magnetic-like backgrounds.
SPPL simplifies probabilistic programming for exact inference.
problem Efficient exact inference in probabilistic models.
method SPPL translates probabilistic programs into sum-product expressions, leveraging new techniques for scalability.
result SPPL achieves up to 3500x speedups in exact inference.
In many real-world problems, we are dealing with collections of high-dimensional data, such as images, videos, text and web documents, DNA microarray data, and more. Often, high-dimensional data lie close to low-dimensional structures corresponding to several classes or categories the data belongs to. In this paper, we…
SySeVR uses deep learning to detect software vulnerabilities.
problem Detecting software vulnerabilities is challenging and important.
method SySeVR combines syntax and semantic information to represent programs for deep learning.
result SySeVR detects 15 unknown vulnerabilities, including 7 unknown and 8 silently patched ones.
Paper characterizes MDM for consumer choice modeling and prediction.
problem Modeling consumer choice behavior with parsimonious models.
method Establishes necessary and sufficient conditions for MDM consistency.
result Characterization leads to exact set of representable choice probabilities.
Unified framework for deep neural network training using linear programming.
problem Theoretical understanding of deep neural network training problems.
method Unified framework using linear programming to represent training problems.
result Polyhedral representation of training problems with linear sample-size dependency.
CLN2INV learns precise loop invariants from program traces.
problem Automated verification of real-world programs with complex loops.
method Continuous Logic Network (CLN) for learning precise loop invariants from program execution traces.
result CLN2INV significantly outperforms existing approaches on the Code2Inv dataset.
We show that the variational representations for f-divergences currently used in the literature can be tightened. This has implications to a number of methods recently proposed based on this representation. As an example application we use our tighter representation to derive a general f-divergence estimator based on t…
SAPS synthesizes code from natural language specifications.
problem Efficiently translating complex NL specifications into executable code.
method Structure-aware neural network using abstract syntax trees and LSTM.
result SAPS produces correct programs in over 92% of cases.
Efficient PAC learning for contrastive linear representations is achieved.
problem Efficient PAC learning for contrastive linear representations.
method Relaxing the problem to a semi-definite program and using Rademacher complexity.
result First efficient PAC learning algorithm for contrastive learning.
Study counterfactuals in combinatorial choice using a representative agent model.
problem Analyzing decision-making from aggregated binary polytope data.
method Nonparametric approach based on a representative agent model, solving polynomial and mixed-integer convex programs.
result Developed a method for counterfactual prediction that works even under model misspecification.
Slice-based Learning improves model performance on critical data subsets.
problem Low performance on critical data subsets in machine learning models.
method Proposes a new programming model (Slice-based Learning) that uses slicing functions to specify critical data subsets and combines these with an attention mechanism.
result Improves model performance by up to 19.0 F1 on slices and 4.6 F1 overall.