Paper proposes a new method to secure power system operation using machine learning.
problem Ensuring secure power system operation under high uncertainty.
method Embedding disjunctive rules from Decision Trees in an optimization framework using GDP and a two-step search method.
result The method achieves efficient system control at a marginal increase in system price compared to an oracle model.
A new framework improves solving mixed-integer convex problems with binary indicators.
problem Optimizing mixed-integer convex problems with binary indicators controlling continuous variables.
method Coordinate Optimality Reformulation (CORe) framework, incorporating coordinate-wise optimality information.
result CORe reformulations improve branch-and-bound performance, especially in sparse and structured settings.
The paper develops mixed-integer formulations for neural networks using partitioning.
problem Optimizing trained ReLU neural networks with balanced model size and tightness.
method Partitioning node inputs into groups, forming the convex hull via disjunctive programming.
result The proposed formulations outperform existing ones, especially with fewer partitions.
Boosts SVMs by perturbing kernels to improve classification of imbalanced and small disjuncts.
problem Class imbalance and small disjuncts in datasets.
method Kernel perturbation to diversify SVMs for boosting, identifying disjuncts.
result Proposed method outperforms state-of-the-art methods on various datasets.
New algorithm learns disjunctions faster than previous methods.
problem Learning Boolean disjunctions in the agnostic PAC model.
method Developed an agnostic learner with complexity 2ildeO(n1/3). result First separation between SQ and CSQ models in distribution-free agnostic learning.
As a contribution to interpretable machine learning research, we develop a novel optimization framework for learning accurate and sparse two-level Boolean rules. We consider rules in both conjunctive normal form (AND-of-ORs) and disjunctive normal form (OR-of-ANDs). A principled objective function is proposed to trade …
Query2box embeds complex queries as boxes to handle logical operations in large KGs.
problem Handling complex logical queries on large-scale incomplete knowledge graphs.
method Embed KG entities and queries into a vector space as boxes, handling conjunctions as intersections and disjunctions through Disjunctive Normal Form.
result Query2box achieves up to 25% relative improvement over state-of-the-art methods.
We obtain multirelative connectivity statements about spaces of smooth embeddings, deducing these from analogous results about spaces of Poincare embeddings that were established in our previous paper.
Study symplectic forms on manifolds to find Lagrangian pinwheels that can be separated.
problem Determine conditions for symplectic forms to carry disjoint Lagrangian pinwheels.
method Use rational blow-up to analyze Lagrangian pinwheels in symplectic manifolds.
result Conditions for disjunction of Lagrangian pinwheels in specific manifolds.
We obtain multirelative connectivity statements about spaces of Poincare embeddings, as precursors to analogous statements about spaces of smooth embeddings. The latter are the key to convergence results in the functor calculus approach to spaces of embeddings.
New method solves matrix completion problems to certifiable optimality.
problem Certifying optimality in low-rank matrix completion.
method Disjunctive branch-and-bound scheme for convex relaxation.
result Decreases optimality gap by two orders of magnitude.
Study integrates reliability constraints into generation planning models.
problem Challenges in integrating reliability constraints with generation planning models.
method Leverages a weighted oblique decision tree (WODT) technique to embed reliability verification constraints.
result Demonstrates effectiveness in achieving reliable and optimal planning solutions.
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.
We give a new approach to intersection theory. Our "cycles" are closed manifolds mapping into compact manifolds and our "intersections" are elements of a homotopy group of a certain Thom space. The results are then applied in various contexts, including fixed point, linking and disjunction problems. Our main theorems r…
DNF-Net tackles tabular data challenges with neural architecture.
problem Handling tabular data efficiently using neural networks.
method DNF-Net uses a neural architecture with inductive bias corresponding to logical Boolean formulas in disjunctive normal form over affine soft-threshold decision terms.
result DNF-Net significantly outperforms fully connected networks on tabular data.
In this paper we prove a stability theorem for block diffeomorphisms of 2d-dimensional manifolds that are connected sums of S^d x S^d. Combining this with a recent theorem of S. Galatius and O. Randal-Williams and Morlet's lemma of disjunction, we determine the homology of the classifying space of their diffeomorphism …
The paper proposes an interpretable off-policy learning algorithm for medical treatments.
problem Lack of interpretable methods for personalized treatment decisions from observational data.
method Hyperbox search approach for interpretable policies in disjunctive normal form.
result The proposed algorithm outperforms state-of-the-art methods in terms of regret and is rated highly interpretable by clinical experts.
Algorithm learns halfspaces robust to Massart noise without distribution knowledge.
problem Learning halfspaces in noisy data with arbitrary marginal distribution.
method Poly-time algorithm for distribution-independent PAC learning.
result Achieves misclassification error of η+ε with poly(d, 1/ε) time complexity.
Paper develops compact formulations for optimization problems with rank-one convex functions and indicator variables.
problem Optimization problems involving rank-one convex functions with support constraints.
method Perspective reformulation techniques to exploit conic structure and establish convex hull results.
result Systematic perspective formulations for convex hull descriptions of sets with nonlinear separable or non-separable objective functions and combinatorial constraints.
Characterizes a specific homology group for certain graphs.
problem Understanding the first uniformly finite homology group with Z coefficients. method Analyzes uniformly locally finite graphs, characterizes the group for trees and Z2 coefficients, and identifies three phenomena for general graphs. result Necessary conditions for non-vanishing of the group in transitive graphs.
SOAR generates rules for both positive and negative classes in binary classification.
problem Lack of interpretability in machine learning models for binary classification.
method Extends or-of-and classification technique to both positive and negative classes.
result Competitive classification performance with simulated-annealing optimization.
We consider the problem of learning a non-negative linear classifier with a 1-norm of at most k, and a fixed threshold, under the hinge-loss. This problem generalizes the problem of learning a k-monotone disjunction. We prove that we can learn efficiently in this setting, at a rate which is linear in both k and…
A new algorithm reduces imbalanced data classification errors in multi-class settings.
problem Imbalanced data classification, especially with noise and overlapping classes.
method MC-CCR algorithm combining cleaning and resampling.
result High robustness to noise and superior performance compared to state-of-the-art methods.
Let n≥2. We prove a homological stability theorem for the diffeomorphism groups of (4n+1)-dimensional manifolds, with respect to forming the connected sum with (2n−1)-connected, (4n+1)-dimensional manifolds that are stably parallelizable. Our techniques involve the study of the action of the diffeomorphism…
Invariant Causal Set Covering Machines avoid spurious associations.
problem Learning algorithms for rule-based models are vulnerable to spurious associations.
method Building on invariant causal prediction, propose Invariant Causal Set Covering Machines for conjunctions/disjunctions of binary-valued rules.
result The method can identify causal parents of a variable of interest in polynomial time.
Improved algorithm for conditional linear regression with heterogeneous covariances.
problem Identifying a linear predictor for a fraction of data with varying covariances.
method Polynomial time algorithm using Disjunctive Normal Form (DNF) to identify a condition and linear predictor.
result Removed requirement for similar covariances in each condition term, improving algorithm applicability.
Deep RL learns effective job shop scheduling rules from raw features.
problem Designing effective priority dispatching rules for job shop scheduling is challenging.
method End-to-end deep reinforcement learning using Graph Neural Networks.
result Agent learns high-quality dispatching rules from raw features and generalizes well to unseen instances.
For an oriented manifold M whose dimension is less than 4, we use the contractibility of certain complexes associated to its submanifolds to cut M into simpler pieces in order to do local to global arguments. In particular, in these dimensions, we give a different proof of a deep theorem of Thurston in foliation …
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.
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.
Energy-based models can generate complex images by combining simpler concepts.
problem Generating natural images that satisfy complex logical combinations of concepts.
method Energy-based models combine probability distributions of simpler concepts to generate compositions.
result Energy-based models can generate images that satisfy conjunctions, disjunctions, and negations of concepts.
A Boolean algebra formalizes task composition for reinforcement learning.
problem Formalizing task composition for efficient learning and problem-solving.
method Formalized tasks as a Boolean algebra, learning goal-oriented value functions, and composing them to solve new tasks.
result Agents can solve new tasks without additional learning by composing value functions in specific ways.
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.
Extends program induction for probabilistic programming.
problem Automatic probabilistic program synthesis for diverse data types.
method Further steps to extend previous work on program induction.
result Generalization over various data types (text, image, video).
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.
New undersampling method reduces computational complexity for imbalanced datasets.
problem Data imbalance in machine learning datasets.
method Radial-Based Undersampling (RBO) using mutual class potential.
result Significantly reduced time complexity of the proposed algorithm.
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.
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.
Proposes NLRL for enhancing neural networks' interpretability.
problem Deep neural networks lack interpretability for humans.
method Introduces neural logic rule layers (NLRL) to represent arbitrary logic rules.
result NLRL-enhanced neural networks can learn complex logic and arithmetic.
Improves neural program synthesis by addressing aliasing and syntax issues.
problem Ignoring program aliasing and syntax in neural program synthesis.
method Reinforcement learning and direct syntax maximization training.
result Improved accuracy, especially with limited training data.
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.
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.
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%.
Dataset of human-written problem statements and solutions for program synthesis.
problem Creating programs from natural language problem descriptions.
method Crowdsourced problem statements and solutions from programming competitions.
result Best model achieved 8.8% accuracy, indicating high complexity.
Quantum approach models economic decisions with probabilistic and dynamic probabilities.
problem Traditional economic models fail to explain recent financial crises.
method Develops a quantum probabilistic framework for economics.
result Quantum circuits can model cognitive phenomena like preference reversal.
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.
Synthesizes static analysis for probabilistic programs.
problem Optimize learning process, verify models, improve programming interface.
method Organize and analyze static analysis techniques for probabilistic programming.
result Future directions for improvement in statistical machine learning.