Generative Adversarial Network repairs software bugs without labeled data.
problem Automated repair of software vulnerabilities.
method Adversarial learning approach mapping between source and target domains.
result Effective at repairing software vulnerabilities, close to seq2seq approaches.
MACER accelerates error repair by modularly identifying and applying fixes.
problem Automated compilation error repair for novice programmers.
method Modular segregation of repair process into identification and application, using discriminative learning techniques.
result MACER outperforms existing methods by 20% on popular errors and is competitive on all error types.
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.
CLSVAE repairs systematic errors in images with minimal labeled data.
problem Repairing systematic errors in data, especially in images.
method CLSVAE models inliers as a smaller latent space representation, separating inlier and outlier patterns.
result CLSVAE achieves superior repairs with less than 2% labeled data, outperforming other methods.
LLMs excel at summarizing and repairing complex models without needing full models.
problem Understanding and repairing complex models like GAMs.
method Hierarchical reasoning and extensive background knowledge.
result LLMs can detect anomalies, describe reasons, and suggest repairs.
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.
Study warranty costs using alternating geometric process models.
problem Evaluate warranty servicing costs with varying repair times and product ages.
method Model repair and operational times using alternating geometric processes and derive new results for finite horizon.
result New insights into warranty costs under different warranty types.
Deep learning detects building defects from images.
problem Time-consuming, laborious, and expensive traditional building condition assessment.
method Convolutional Neural Networks (CNN) with class activation mapping (CAM) for object localisation.
result Robust model accurately detects and localises building defects.
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.
New method to recover over-parameterized models corrupted during estimation.
problem Recovering statistical models corrupted after initial estimation.
method Robust estimation using over-parameterized models and redundancy.
result Stochastic gradient descent is well-suited for model repair, but sparsity is generally not repairable.
RVAE detects and repairs corrupted cells in mixed-type tabular data.
problem Outlier detection and repair in mixed-type tabular data.
method Robust Variational Autoencoder (RVAE) learns the joint distribution of clean data and identifies outlier cells.
result RVAE outperforms state-of-the-art methods in cell outlier detection and repair for tabular data.
Proposes a method to repair arbitrage in option prices data.
problem Arbitrage in option price data can lead to poor performance or failure of financial applications.
method Formulates data repair as a linear programming (LP) problem to minimise price changes within bid and ask price bounds.
result The proposed method gives sparse perturbations on data and improves model calibration with enhanced robustness and reduced calibration error.
REPAIR mitigates variance collapse to enable linear interpolation between SGD solutions.
problem Linear interpolation between SGD solutions is difficult due to variance collapse in permuted activations.
method REPAIR rescales preactivations of interpolated networks to mitigate variance collapse.
result 60%-100% relative barrier reduction across various architectures and tasks.
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.
SnareNet adds repair layers to neural networks to ensure outputs meet physical constraints.
problem Unconstrained neural network predictions violate physical or safety requirements.
method SnareNet appends a differentiable repair layer that navigates constraints to produce feasible outputs.
result SnareNet consistently improves objective quality while satisfying constraints more reliably.
Machine learning algorithms can unintentionally discriminate, requiring new principles for fairness.
problem Unintentional discrimination in machine learning algorithms.
method Develop theoretical understanding and global optimization criteria for machine learning fairness.
result Establish fundamental principles for preventing algorithmic discrimination.
CROP verifies clean prefixes in reasoning traces, improving downstream repair accuracy.
problem Uncertainty in reasoning traces prevents full certification of entire responses.
method CROP selects a calibrated threshold to certify the longest prefix with low risk proxies.
result CROP improves downstream repair accuracy by preserving valid reasoning and discarding misleading suffixes.
Sparse metric repair minimizes changes to data to make distances metric.
problem Repairing noisy metric distances with minimal changes.
method Three combinatorial algorithms to minimize sparsity of changes.
result Guaranteed sparsest solution in one setting, metric repair in others.
CASP improves portfolio optimization by considering asset covariance.
problem Infeasibility in cardinality-constrained portfolio optimization.
method CASP uses volatility-normalized selection and covariance-aware projection.
result CASP-Basic delivers lower portfolio variance than standard Euclidean repair.
We present a new application and covering number bound for the framework of "Machine Learning with Operational Costs (MLOC)," which is an exploratory form of decision theory. The MLOC framework incorporates knowledge about how a predictive model will be used for a subsequent task, thus combining machine learning with t…
Paper proposes fair ML predictors to avoid discrimination.
problem Discrimination in ML predictors from historical data.
method Proposes two algorithms to adjust ML predictors for fairness.
result Proves fair EO and AA predictors are optimal in performance.
Graph neural network predicts JavaScript types with high accuracy.
problem Automatic code repair for JavaScript programs.
method Graph Neural Network model for token type prediction.
result Achieved above 90% accuracy in token type predictions.
The above named paper has been withdrawn. A colleague has observed a gap in the proof of isotopy invariance, which can be repaired by reducing the coefficients (which lie in (1/6)Z) of the antisymmetric kanji with chords incident with more than one component modulo 8Z. An analogous issue arises in considering the effec…
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.
Withdrawn May 2005. There is an error in the even-dimensional case of the proof in the April 2005 version. The hoped-for 4-dimensional applications are unlikely to survive the repairs.
We study graphs of (generalized) joins and intersections of finitely generated subgroups of a free group. We show how to disprove a lemma of Imrich and Müller on these graphs and how to repair this lemma.
Compact geometry shows only one way to handle punctures.
problem Volume growth estimates for compact manifolds with punctures.
method Volume growth estimates around a point to prove conformal compactification.
result The only conformal compactification of M∖{p} is M itself. 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.
A complete error analysis of variational integrators is obtained, by blowing up the discrete variational principles, all of which have a singularity at zero time-step. Divisions by the time step lead to an order that is one less than observed in simulations, a deficit that is repaired with the help of a new past-future…
The paper addresses fairness in machine learning by adjusting input distributions.
problem Reducing disparate impact in machine learning models over different groups.
method The approach involves learning a counterfactual distribution to adjust input variables for disadvantaged groups.
result The method can reduce disparate impact without training a new model.
Optimal pre-processing reduces disparate impact by minimizing total variation distance.
problem Achieving fairness in data outputs based on protected attributes.
method Using pre-processing to enforce fairness, minimizing total variation distance between pre-processed and original data distributions.
result The problem of fairness can be formulated as a linear program, efficiently solvable.
IPO Finance Agent extends Finance Agent v2 for SpaceX S-1 filings, improving accuracy and cost-efficiency.
problem Evaluating IPO due diligence tasks with long-form documents.
method Extended task domain, improved agentic harness with contextual retrieval, automated rubric generation.
result Best-performing model reaches 79.8% accuracy, cost-efficient model at 77.2% with 0.05 USD per query.
The Cayley hyperbolic space minimizes volume entropy among finite-volume metrics.
problem Volume entropy rigidity in Cayley hyperbolic spaces.
method Repairing a gap in the proof of volume entropy rigidity theorem.
result Cayley hyperbolic space minimizes volume entropy.
Prediction Factory automates predictive model development and evaluation.
problem Rapidly developing and sharing predictive models with domain experts.
method Data science automation system with three interfaces: baseline, full, and optional automation.
result Full automation interface generated reports funded 57.5% of the time, compared to 42.5% for baseline.
Automated theorem prover proves non-orderability of groups.
problem Proving non-orderability of groups.
method Generic automated theorem prover with tools like positive cones, torsions, generalised torsions, and cofinal elements.
result Demonstrated automated proof of non-orderability of groups.
Predicts power outages duration using neural networks and text analysis.
problem Predicting duration of distribution system outages.
method Historical data for training neural networks, environmental factors for initial prediction, text analysis for updates.
result Improved performance with text analysis for identifying outage causes and repair steps.
Study identifies what healthcare tasks can and should be automated.
problem Undesired consequences of automation in healthcare.
method Quantitative analysis using machine learning models trained on practitioner and expert ratings.
result Developed an analytical tool (Automatability-Desirability Matrix) for policymakers and leaders.
This paper surveys scalable automated alignment methods for LLMs.
problem Scalability issues in traditional human-annotated alignment methods for LLMs.
method Categorizes and discusses various automated alignment methods.
result Emerging automated alignment methods are effective and scalable.
This paper uses machine learning to assist automation engineers in decision making.
problem Imperfect decision making by automation engineers leads to multiple iterations and increased time for software development.
method Defined challenges and proposed solutions using machine learning for automation engineering, including code classification, finding similar code snippets, and hardware selection.
result Paragraph embedding techniques achieved an F1-score of 72% for classifying automation using code snippets, and autoencoder models for hardware recommendation achieved p@3 and p@5 of 0.79 and 0.95, respectively.
Automated strategies improve model adaptation efficiency.
problem Manual adaptation strategies are time-consuming and costly.
method Flexible adaptive mechanism deployment for automated adaptation strategies.
result Automated strategies achieve better or comparable performance.
Automated machine learning simplifies model selection and tuning.
problem Manual tuning of machine learning models by data scientists is time-consuming and requires extensive expertise.
method Review of AutoML techniques including automated feature engineering, model learning, and deep learning.
result Current AutoML techniques can significantly reduce the burden of manual tuning.
New automated market makers for multi-asset trading.
problem Liquidity management in multi-asset trading.
method Derived from self-financing transactions and rebalancing principles.
result Constant product market maker as a special case.
DriveML automates machine learning tasks in R.
problem Manual machine learning tasks are time-consuming and error-prone.
method Automated data preparation, feature engineering, model building, and model explanation.
result DriveML performs best across different parameters compared to other packages.
The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones polynomial and arise in Witten-Chern-Simons theory. The braiding and fusion of anyonic excitations in quantum Hall electron liqu…
Automated tasks improve MTL models for various NLP tasks.
problem Improving performance of primary NLP tasks through MTL.
method Training on sequential secondary tasks like next word prediction.
result MTL models converge faster and perform better on various NLP tasks.
This paper reviews R packages for automating data analysis tasks.
problem Time-consuming Exploratory Data Analysis in large, noisy data sets.
method Systematic review of 12 R packages for autoEDA.
result Identifies automated tasks and areas for future development.
New methods for equity fund selection and portfolio construction using mutual fund top holdings.
problem Classic equity fund selection and portfolio construction problems.
method Propose an easy-to-implement framework to produce a long-short portfolio from mutual fund top holdings.
result Generate impressive results and show statistical evidence.
The complement of an arrangement A of a finite number of affine hyperplanes in complex n-space has the structure of a poset of spaces indexed by the intersection poset, L(A). The space corresponding to G in L(A) is homotopy equivalent to the complement of the hyperplanes in the central arrangement A_G normal to G. This…