Generative model learns diverse fixes for program errors.
problem Uncertainty in predicting a single fix for program errors.
method Deep conditional variational autoencoder with diversity regularizer.
result Strong improvements over state-of-the-art approaches, generating up to 45% diverse fixes.
The paper teaches a reinforcement learning agent to generate diverse programs based on symbolic instructions.
problem Learning to generate diverse programs for diverse scenes given a symbolic instruction.
method Instruction-conditioned reinforced adversarial learning.
result The agent's stochastic policy more accurately captures the diversity in the goal distribution.
Efficiently finds diverse coherent counterfactual explanations.
problem Finding coherent counterfactual explanations for complex data.
method Mixed integer programming with mixed polytope constraints.
result Efficiently generates diverse coherent counterfactual explanations.
Supporting evidence for adaptive feature program across diverse models.
problem Analyzing feature learning in neural networks.
method Over-parameterized sequence models and feature error measure (FEM).
result FEM is decreasing during training of adaptive feature models.
COSET benchmarks neural program embeddings using diverse source-code datasets.
problem Evaluating neural program embeddings is challenging due to lack of straightforward metrics.
method COSET framework with labeled programs, transformations, and a pilot study.
result COSET identifies strengths and weaknesses of neural models and program characteristics.
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.
Paper introduces a novel method to generate diverse inputs for neural programming by example.
problem Synthesizing programs from input/output pairs using machine learning.
method Uses an SMT solver to generate diverse input-output pairs.
result Generated inputs improve model performance and generalization.
A personalized learning system needs a large pool of items for learners to solve. When working with a large pool of items, it is useful to measure the similarity of items. We outline a general approach to measuring the similarity of items and discuss specific measures for items used in introductory programming. Evaluat…
PLANS synthesizes programs from noisy inputs using neural specs and filtering.
problem Synthesizing robust programs from noisy, raw inputs.
method Hybrid model combining neural extraction and rule-based synthesis with noise filtering.
result State-of-the-art performance in diverse environments with no ground-truth training.
The paper proposes a happiness-based fairness framework using linear programming.
problem Fairness in decision-making outcomes.
method Linear programming to compute optimal, fair post-processing strategies.
result Unified and extended fairness definitions with practical strengths across diverse scenarios.
Efficiently samples sequences without replacement for machine learning models.
problem Generating diverse outputs from sequential models without duplicates.
method Incremental sampling procedure for randomized programs, including neural models.
result Efficacy and flexibility of incremental sampling for large output spaces.
MEC-IP uses IP to efficiently find MECs in BNs from observational data.
problem Discovering Markov Equivalent Classes (MECs) in Bayesian Networks (BNs) efficiently.
method Clique-focusing strategy and EMSG for MEC discovery via Integer Programming.
result Significant reduction in computational time and improved accuracy.
DisCoPyro combines category theory with machine learning for program learning.
problem Applying category theory to machine learning tasks.
method Introducing DisCoPyro, a framework combining categorical structures with amortized variational inference.
result DisCoPyro can be applied in program learning for variational autoencoders and potentially contributes to AGI.
PClean automates Bayesian data cleaning for specific datasets.
problem Bayesian inference for diverse and complex data cleaning.
method Domain-specific probabilistic programming language with custom models and inference.
result PClean programs outperform general-purpose PPLs in accuracy and runtime.
Extends gradient-based optimization to spline functions.
problem Limitations of standard differentiable programming methods.
method Derives Jacobian of spline functions and uses it in predictive models.
result Improved performance in various applications.
Novel approach trains LLMs for inductive reasoning using probabilistic programs.
problem Training LLMs for inductive reasoning with sparse, ambiguous data.
method Program-based Posterior Training (PPT) using probabilistic inference.
result Significant improvement in estimation accuracy and alignment with human judgments.
This research develops an evolutionary approach to discover non-Gaussian stochastic dynamical systems.
problem Discovering explicit governing equations of stochastic dynamical systems with Lévy noise from data.
method ESSR approach using genetic programming, sparse regression, and nonlocal Kramers-Moyal formulas.
result The approach effectively extracts non-Gaussian stochastic dynamical systems from sample path data.
New method learns BN structures from data efficiently.
problem Learning sparse DAG structure of BN from continuous data.
method Consistent second-order conic integer programming with early stopping criterion.
result Near-optimal solutions to medium-size problems within reasonable time.
Deep learning has seen tremendous success over the past decade in computer vision, machine translation, and gameplay. This success rests in crucial ways on gradient-descent optimization and the ability to learn parameters of a neural network by backpropagating observed errors. However, neural network architectures are …
Alpha2 discovers logical formulaic alphas using deep reinforcement learning.
problem Discovering interpretable formulaic alphas for better trading strategies.
method Formulating alpha discovery as program construction, using deep reinforcement learning to navigate the search space.
result Empirical experiments show Alpha2 identifies diverse, logical, and effective alphas improving trading strategy performance.
In the past few years, a lot of attention has been devoted to multimedia indexing by fusing multimodal informations. Two kinds of fusion schemes are generally considered: The early fusion and the late fusion. We focus on late classifier fusion, where one combines the scores of each modality at the decision level. To ta…
In recent years, optimization theory has been greatly impacted by the advent of sum of squares (SOS) optimization. The reliance of this technique on large-scale semidefinite programs however, has limited the scale of problems to which it can be applied. In this paper, we introduce DSOS and SDSOS optimization as linear …
The objective of this paper is to define an effective strategy for building an ensemble of Genetic Programming (GP) models. Ensemble methods are widely used in machine learning due to their features: they average out biases, they reduce the variance and they usually generalize better than single models. Despite these a…
Improves scalability of Bayesian optimization for combinatorial spaces.
problem Optimizing expensive functions over large combinatorial spaces.
method Parametrized Submodular Relaxation (PSR) to solve AFO problems for BOCS.
result Significant improvements in scalability and accuracy for BOCS model.
This study proposes a graph partitioning method to improve spatial prediction models.
problem Improving interpretability of spatial prediction models in industries.
method Graph partitioning problem to minimize within-segment variances, formulated as mixed-integer quadratic programming.
result Approximation scheme efficiently identifies spatial segments, improving computational efficiency.
AlphaEval evaluates alpha mining models efficiently and comprehensively.
problem Lack of systematic evaluation for alpha mining models.
method Unified, parallelizable evaluation framework assessing predictive power, stability, robustness, financial logic, and diversity.
result AlphaEval achieves evaluation consistency comparable to comprehensive backtesting, providing more comprehensive insights and higher efficiency.
Maximizes determinant of vector sums under matroid constraints.
problem Finding a basis in a matroid that maximizes the determinant of vector sums.
method New approximation algorithm with guarantees depending only on vector dimension.
result Significant improvement in approximation guarantees for various matroids.
Motivation: The rapid growth of diverse biological data allows us to consider interactions between a variety of objects, such as genes, chemicals, molecular signatures, diseases, pathways and environmental exposures. Often, any pair of objects--such as a gene and a disease--can be related in different ways, for example…
Convolutional neural networks (CNNs) are effective at solving difficult problems like visual recognition, speech recognition and natural language processing. However, performance gain comes at the cost of laborious trial-and-error in designing deeper CNN architectures. In this paper, a genetic programming (GP) framewor…
In this paper we propose an approach to preference elicitation that is suitable to large configuration spaces beyond the reach of existing state-of-the-art approaches. Our setwise max-margin method can be viewed as a generalization of max-margin learning to sets, and can produce a set of "diverse" items that can be use…
Machine learning techniques improve SCUC problem solving speed and efficiency.
problem Improving computational performance of SCUC problem solving.
method Predicting redundant constraints, initial feasible solutions, and optimal solution subspaces.
result Significant reduction in problem size and faster solution times.
We present a procedure for effective estimation of entropy and mutual information from small-sample data, and apply it to the problem of inferring high-dimensional gene association networks. Specifically, we develop a James-Stein-type shrinkage estimator, resulting in a procedure that is highly efficient statistically …
This work extends reinforcement learning to handle non-cumulative objectives.
problem Optimizing functions of rewards rather than their sum in decision processes.
method Mapping NCMDPs to standard MDPs for reinforcement learning.
result Reinforcement learning techniques can be applied to NCMDPs.
Water saturation is an important property in reservoir engineering domain. Thus, satisfactory classification of water saturation from seismic attributes is beneficial for reservoir characterization. However, diverse and non-linear nature of subsurface attributes makes the classification task difficult. In this context,…
With the intent of laying the groundwork for a program that aims at explicitly describing the space of Cartan (i.e. multiplicative) connections on a general proper Lie groupoid, we begin to investigate the space of such connections in the regular case. We point out that there is a close relationship between Cartan conn…
SED integrates synthesis, execution, and debugging for neural program synthesis.
problem Challenges in synthesizing complex programs that match specifications.
method SED combines synthesis, execution, and debugging to improve neural program generation.
result SED reduces error rates and outperforms standard decoding methods.
Co-designing efficient machine learning based systems across the whole hardware/software stack to trade off speed, accuracy, energy and costs is becoming extremely complex and time consuming. Researchers often struggle to evaluate and compare different published works across rapidly evolving software frameworks, hetero…
GLIMPS tackles abundant outlier detection in matched subspace detection.
problem Detecting matched subspaces in high-dimensional data with a high proportion of outliers.
method Two-stage approach combining greedy algorithm and mixed integer programming.
result GLIMPS can tolerate over 80% outliers, significantly outperforming state-of-the-art methods.
Stochastic programs simplify complex models with noise and nondeterminism.
problem Handling models with nuisance parameters, noise, and nondeterminism.
method Developed a reference implementation for stochastic probabilistic programs and inference.
result Efficient inference in models with noise and nondeterminism is possible.
Deployable probabilistic programming for Go and other languages.
problem Adding probabilistic programming to mainstream languages.
method Design guidelines and Infergo implementation for Go.
result Infergo demonstrates performance and applicability in various use cases.
Improves probabilistic programming by analyzing program structure.
problem Inefficiency and limitations of single inference algorithms in probabilistic programming.
method Three novel techniques: static and dynamic analyses to adapt programs for more efficient inference.
result Improves probabilistic programming by making inference more efficient.
A neural program synthesis method with iterative fix operations.
problem Creating correct programs from input-output examples.
method Combines encoder-decoder synthesis with a differentiable fixer.
result Improves synthesis accuracy by reducing discrepancies between outputs and desired outputs.
Paper introduces techniques to learn higher-order programs, improving predictive accuracy and reducing learning times.
problem Expressing and learning complex programs in ILP.
method Extending meta-interpretive learning to support higher-order definitions as background knowledge.
result Learning higher-order programs reduces hypothesis space and sample complexity, improving predictive accuracy and reducing learning times.
NEST optimizes deep learning training by placing devices efficiently across networks and memory.
problem Inefficient device placement in distributed deep learning leads to high communication and memory overhead.
method NEST uses network-, compute-, and memory-aware dynamic programming to optimize device placement.
result NEST achieves up to 2.43 times higher throughput and better memory efficiency.
Graph-based approach repairs programs from diagnostic feedback.
problem Learning to repair programs from limited labeled data and compiler error messages.
method Introduces program-feedback graph and graph neural network for reasoning, and self-supervised learning with unlabeled programs.
result DrRepair significantly outperforms prior work, achieving high repair rates.
BatchBALD selects multiple informative points for deep Bayesian active learning, improving data efficiency.
problem Efficient and diverse selection of points for deep Bayesian active learning.
method Develops BatchBALD, a greedy linear-time approximation to mutual information, as an acquisition function.
result Achieves new state-of-the-art performance on benchmarks, improving data efficiency.
SPoC uses search to translate pseudocode into correct programs with error localization.
problem Mapping pseudocode to functionally correct long programs.
method Search-based approach guided by compilation errors for credit assignment.
result Search improves synthesis success rate from 25.6% to 44.7%.
New method reduces infinite variance in probabilistic programs with rejection sampling.
problem Infinite variance in naive importance sampling for programs with rejection sampling.
method Developed a new amortized importance sampling estimator with finite variance proof.
result Empirically demonstrated efficiency and correctness compared to existing alternatives.