Jointly learning to localize and repair variable-misuse bugs improves program repair.
problem Variable-misuse bugs in programs.
method Multi-headed pointer networks for joint localization and repair.
result Joint model significantly outperforms an enumerative solution.
We explore the perspective of a bug living on the two-dimensional surface of a polyhedron. Images of various kinds of effects like lensing and cloaking are shown via color pictures of three viewpoints: the first person perspective of the bug, a map of the bug's viewpoint, and a look at the bug on the embedded polyhedro…
Paper presents a neural network method for automated bug and ticket classification.
problem Automated classification of bug and ticket content in systems.
method Recurrent neural network with hierarchical attention mechanism.
result The method outperforms previous approaches on two datasets.
Develops a deep metric learning approach for detecting bugs in video games.
problem Automated detection of bugs in video games.
method State-State Siamese Networks (S3N) for deep metric learning.
result S3N learns meaningful embeddings to identify various types of bugs.
Training set bugs are flaws in the data that adversely affect machine learning. The training set is usually too large for man- ual inspection, but one may have the resources to verify a few trusted items. The set of trusted items may not by itself be adequate for learning, so we propose an algorithm that uses these ite…
SequenceR uses seq-to-seq learning to fix bugs in code.
problem Fixing bugs in code using machine learning.
method Sequence-to-sequence learning with copy mechanism, trained on curated code samples.
result SequenceR can perfectly predict and find correct patches for bugs.
Develops Kleinian Sphere Packings and Bugs, proving their arithmetic origins.
problem Understanding sphere packings and their arithmetic origins in various dimensions.
method Introduces Kleinian Sphere Packings and Bugs, extending Arithmeticity Theorem.
result Kleinian packings and Bugs come from Q-arithmetic lattices of simplest type.
This work uses image generation models to find vision model bugs.
problem Automatically discovering failures in vision models.
method Conditional text-to-image generation and captioning models.
result Demonstrated utility of large-scale generative models to find vision model bugs.
Automated graphics testing detects novel corruptions without manual labeling.
problem Detecting novel visual corruptions in graphics unit testing without manual labeling.
method Reproduces driver bugs to generate corruptions and uses Multiple Instance Learning (MIL) methods.
result Significantly outperforms unsupervised methods and discovers novel corruptions.
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…
TFCheck detects training issues in ML programs using TensorFlow.
problem Training programs often contain inconsistencies and bugs.
method Developed a TensorFlow library (TFCheck) with verification routines.
result TFCheck successfully detects training issues in ML code.
Bayes-optimal classifiers are robust to adversarial attacks, unlike CNNs trained on the same data.
problem The vulnerability of modern CNN classifiers to adversarial examples.
method Constructing realistic image datasets and deriving analytic conditions for Bayes-optimal classifiers.
result Bayes-optimal classifiers are robust to adversarial attacks, unlike CNNs trained on the same data.
Neural network identifies undeclared variables and infers their types.
problem Undeclared variable errors in programs.
method Trained on structural semantic details of AST, identifies and infers types of undeclared variables.
result Correctly identified and inferred types for 80% of programs with undeclared variable errors.
This research simplifies verification of machine learning systems using reparameterization.
problem Reduce or eliminate serious bugs in machine learning systems.
method Use proof assistants to construct machine-checked proofs of correctness, leveraging reparameterization to handle probabilistic claims.
result Demonstrates broad applicability of reparameterization to verify different types of machine learning systems.
Improves federated learning robustness against data corruption.
problem Noise corruption of local agents in federated learning.
method Collaborative machine teaching with trusted instances.
result Effective identification and correction of training set bugs.
The paper develops methods to identify and correct buggy data in linear regression models.
problem Identifying and correcting buggy data in linear regression models.
method Formulated a general statistical algorithm for identifying buggy points, provided theoretical guarantees, and proposed an algorithm for tuning parameter selection.
result Theoretical guarantees and empirical results show the effectiveness of the proposed debugging algorithm.
Unified platform SOCRATES for neural network analysis.
problem Analyzing neural networks for bugs and fairness.
method Standardized format, assertion language, and multiple analysis algorithms.
result Unified platform for neural network analysis.
Forward Automatic Differentiation (AD) is a technique for augmenting programs to compute derivatives. The essence of Forward AD is to attach perturbations to each number, and propagate these through the computation. When derivatives are nested, the distinct derivative calculations, and their associated perturbations, m…
Adversarial attacks found to be effective on code models.
problem Adversarial robustness of code models.
method Instantiated adversarial attacks for code, demonstrated vulnerability, and improved robustness.
result Neural models for code are vulnerable to adversarial attacks.
Expert-augmented algorithm boosts scores in Montezuma's Revenge.
problem Sparse rewards in Montezuma's Revenge.
method Expert-augmented actor-critic algorithm.
result Achieves above 27,000 points consistently, surpassing expert performance.
Corrected CBOW performs similarly to Skip-gram.
problem CBOW embeddings underperform Skip-gram embeddings in word2vec.
method Fixed a bug in CBOW gradient update to improve performance.
result Corrected CBOW embeddings are competitive with Skip-gram on various tasks.
In General Relativity the metric can be recovered from the structure of the lightcones and a measure giving the volume element. Since the causal structure seems to be simpler than the Lorentzian manifold structure, this suggests that it is more fundamental. But there are cases when seemingly healthy causal structure an…
Adversarial examples are due to non-robust features in data.
problem Understanding the reasons behind adversarial examples in machine learning.
method Developed a theoretical framework to identify non-robust features and demonstrated their widespread existence.
result Adversarial examples are a result of non-robust features in data.
Neural program analyzers are brittle and sensitive to input changes.
problem Reliability of neural program analyzers in software engineering.
method Developing testing techniques for neural program analyzers.
result Simple input perturbations can cause neural program analyzers to make mistakes.
Develops deep learning for logical code segmentation.
problem Lack of logically segmented source code.
method Novel deep learning approach to generate logical code segments.
result Improves software analysis tasks like commenting, bug detection, and code synthesis.
No real-world reward function is perfect. Sensory errors and software bugs may result in RL agents observing higher (or lower) rewards than they should. For example, a reinforcement learning agent may prefer states where a sensory error gives it the maximum reward, but where the true reward is actually small. We formal…
New research shows spurious samples in deep models are not errors but a feature.
problem Whether spurious samples can be eliminated without losing model coverage.
method Experimental study on deep generative models.
result Spurious samples cannot be completely eliminated without losing model ability to generate some test samples.
PettingZoo library accelerates multi-agent reinforcement learning research.
problem Challenges in multi-agent reinforcement learning, especially conceptual models of games.
method Developed PettingZoo library with AEC games model to address multi-agent reinforcement learning challenges.
result AEC games model addresses conceptual issues in multi-agent reinforcement learning environments.
This paper introduces a new technique for quantifying the approximation error of a broad class of probabilistic inference programs, including ones based on both variational and Monte Carlo approaches. The key idea is to derive a subjective bound on the symmetrized KL divergence between the distribution achieved by an a…
New method improves ResNet performance without batch normalization.
problem Improving ResNet performance without batch normalization.
method Adapted Weight Standardization to maintain signal propagation.
result Highly performant ResNets achieve state-of-the-art performance on ImageNet.
Although software analytics has experienced rapid growth as a research area, it has not yet reached its full potential for wide industrial adoption. Most of the existing work in software analytics still relies heavily on costly manual feature engineering processes, and they mainly address the traditional classification…
Convolutional neural network summarizes code comments across multiple languages.
problem Insufficient or missing comments in source code.
method Language-agnostic encoder-decoder model with open vocabulary.
result Comparable results to state-of-the-art on single-language data; first results on multi-language data.
Improved RL model for fragment-based molecule generation.
problem Generating molecules with high docking scores.
method Thorough reproduction, scrutiny, and improvement of the FREED model.
result The improved model produces molecules with superior docking scores.
A new distribution fixes a common error in VAEs, improving image quality.
problem Using a Bernoulli likelihood for pixel data in VAEs.
method Introducing the continuous Bernoulli distribution.
result The continuous Bernoulli improves image quality across various metrics and datasets.
ODTLearn learns optimal decision trees for predictive and prescriptive tasks.
problem Learning optimal decision trees for high-stakes predictive and prescriptive tasks.
method Mixed-integer optimization framework and object-oriented design.
result Implementation of optimal decision trees for various tasks.
New auditors assess f-DP privacy with adaptive sampling, avoiding large sample sizes.
problem Empirical auditing of f-DP privacy with adaptive sampling. method Shift focus to f-DP, develop adaptive auditors for whitebox and blackbox settings. result Adaptive auditors detect f-DP violations across the privacy spectrum with statistical guarantees. The simulator is an R package that streamlines the process of performing simulations by creating a common infrastructure that can be easily used and reused across projects. Methodological statisticians routinely write simulations to compare their methods to preexisting ones. While developing ideas, there is a temptatio…
Thousands of security vulnerabilities are discovered in production software each year, either reported publicly to the Common Vulnerabilities and Exposures database or discovered internally in proprietary code. Vulnerabilities often manifest themselves in subtle ways that are not obvious to code reviewers or the develo…
Boosting framework improves adversarial robustness in deep learning.
problem Adversarial robustness of deep neural networks.
method Multiclass boosting framework with theoretical guarantees.
result Multiclass boosting achieves adversarial robustness faster than state-of-the-art methods.
This paper generates natural-looking perturbations to fool classifiers.
problem Generating adversarial examples that mimic natural objects or signals.
method Employing generative adversarial networks and optimization algorithms.
result The approach can fool classification models in both image and audio domains.
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.
Blang simplifies Bayesian analysis for non-standard data types.
problem Bayesian inference for non-standard data structures.
method Bayesian declarative language, distribution continua, sequential Monte Carlo, non-reversible MCMC.
result Bayesian analysis on arbitrary data types is feasible and efficient.
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.
DG separates successes and failures by gating updates with advantage and surprisal.
problem Negative learning from surprising data in distributed reinforcement learning.
method DG gates each update with the product of advantage and surprisal, suppressing failures and preserving successes.
result DG outperforms other methods in various challenging reinforcement learning tasks.
Propensity score matching improves fairness in machine learning models.
problem Bias in training data affects fairness metrics in machine learning models.
method Propensity score matching to evaluate and mitigate bias in test data.
result FairMatch significantly reduces bias in test data without sacrificing predictive performance.
Random Forests [Breiman:2001] (RF) are a fully non-parametric statistical method requiring no distributional assumptions on covariate relation to the response. RF are a robust, nonlinear technique that optimizes predictive accuracy by fitting an ensemble of trees to stabilize model estimates. The randomForestSRC packag…
Microbes are everywhere, including in and on our bodies, and have been shown to play key roles in a variety of prevalent human diseases. Consequently, there has been intense interest in the design of bacteriotherapies or "bugs as drugs," which are communities of bacteria administered to patients for specific therapeuti…
Asynchronous distributed machine learning solutions have proven very effective so far, but always assuming perfectly functioning workers. In practice, some of the workers can however exhibit Byzantine behavior, caused by hardware failures, software bugs, corrupt data, or even malicious attacks. We introduce \emph{Karda…