New system learns programs from descriptions, outperforming brute-force methods.
problem Learning to write programs from descriptions.
method Intelligent search system using glass-box loss function.
result Significant improvements in accuracy and time compared to brute-force search.
DNAMite creates interpretable, calibrated survival analysis models.
problem Limited interpretability in survival analysis models, especially for healthcare applications.
method Feature discretization and kernel smoothing in embedding module for flexible shape functions.
result DNAMite produces calibrated shape functions interpretable as contributions to cumulative incidence function.
HDMR provides insights into machine learning models, aiding in both prediction and explanation.
problem Understanding and interpreting complex machine learning models.
method High Dimensional Model Representation (HDMR) and its applications in machine learning.
result HDMR offers a glass box approach to machine learning models, enhancing both prediction and explanation.
Paper proposes hybrid approach for transparent credit scoring models.
problem Lack of transparency in machine learning models limits their use in regulated environments.
method Post-hoc interpretation of black-box models guides feature selection, followed by training glass-box models.
result Reduces feature usage from 106 to 10 while maintaining comparable performance.
Interactive machine learning with human input tackles complex problems like the Traveling Salesman Problem.
problem Complex NP-hard problems in health informatics with limited data.
method Interactive machine learning (iML) with a human-in-the-loop to solve the Traveling Salesman Problem (TSP).
result Demonstrates effectiveness of iML in making machine learning transparent and interactive.
Method uses elastic black-boxes to create interpretable models from complex ones.
problem Lack of trust and stability in opaque models and time-consuming feature engineering in interpretable models.
method Surrogate assisted feature extraction for model learning.
result Trains interpretable and accurate models without time-consuming feature engineering.
Automated feature engineering improves interpretable models without manual work.
problem Lack of interpretability in complex models causes trust and stability issues.
method Use elastic black-box models to create simpler, interpretable glass-box models.
result Extracted features from complex models improve linear model performance.
ParamBoost uses gradient boosting to create interpretable non-linear models with constraints.
problem Creating interpretable non-linear models with expert knowledge constraints.
method Gradient Boosting of cubic polynomials with specified constraints.
result ParamBoost outperforms state-of-the-art GAMs in real-world datasets.
Data science principles enhance AI interpretability for better user control.
problem Risks from opaque AI models without clear impacts.
method Synthesizes principles from interpretability literature, emphasizing audience goals.
result Illustrates basic techniques and criteria for evaluating interpretability.
Optimal allocation between explainable and black box models for high performance and explainability.
problem Balancing explainability and performance in model ensembles.
method Optimal allocation of observations between explainable and black box models to maximize ensemble performance and explainability.
result Learned allocations maintain high ensemble performance and explainability, sometimes outperforming individual models.
Bayesian hybrid models correct for missing physics in machine learning.
problem Systematic bias in machine learning models.
method Fusing physics-based insights with machine learning constructs, using Bayesian calibration and stochastic programming.
result Bayesian hybrid models outperform pure machine learning approaches with less data.
New statistical methods improve explainability of boosting models.
problem Uncertainty quantification for boosting models is computationally intensive and hard to interpret.
method Derive methods for statistical inference using gradient boosting and Boulevard regularization.
result Achieve asymptotically normal predictions with theoretical guarantees and runtime independent of data size.
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.
EBMs become opaque in high dimensions; LASSO sparsifies them.
problem Reducing complexity and improving interpretability of EBMs in high-dimensional settings.
method Applying LASSO to reweight and remove less relevant terms from EBMs.
result EBMs maintain transparency and fast scoring times with reduced complexity.
EBM improves car insurance claim severity and frequency prediction while maintaining interpretability.
problem Balancing predictive accuracy and interpretability in insurance claim modeling.
method Combines GAM and cyclic gradient boosting, providing interpretable predictions.
result EBM outperforms benchmark models in claim severity and frequency prediction.
NGRs merge sparse graph recovery with PGMs for efficient probabilistic inference.
problem Efficiently recover sparse graphs and learn distributions over variables.
method Integrates sparse graph recovery methods with PGMs using Graph-constrained path norm.
result NGRs can handle multimodal data and perform sparse graph recovery and probabilistic inference.
Bayesian optimization reduces computational effort in aircraft design optimization.
problem High computational cost in industrial aircraft design optimization.
method Constrained Bayesian optimization (Super Efficient Global Optimization with Mixture of Experts)
result Significant computational efficiency improvements over existing Isight optimizers.
New model reduces hyperparameter optimization time and improves transfer learning.
problem Hyperparameter optimization for machine learning across multiple datasets.
method Developed a new ensemble model for Bayesian optimization that transfers knowledge between datasets.
result Substantially reduces optimization time and improves over state-of-the-art transfer hyperparameter optimization.
Bayesian optimization outperforms other methods in nano-optical shape optimization and parameter reconstruction.
problem Optimizing nano-optical structures with non-convex objective functions.
method Benchmarked five global optimization methods including Bayesian optimization.
result Bayesian optimization yields significantly better results in a fraction of the time.
Bayesian optimization method tackles combinatorial spaces, scalable for large data.
problem Optimization over combinatorial categorical spaces in natural sciences.
method Combines variational optimization and continuous relaxations for gradient-based optimization.
result Method performs comparably to state-of-the-art methods while scaling well.
New algorithm solves complex stopping problems with robust optimization.
problem Solving complex stochastic optimal stopping problems.
method Simulation-based robust optimization with exact reformulation as a zero-one bilinear program.
result Developed polynomial-time heuristics and algorithms for practical solution.
L2O uses ML to optimize traditional optimization techniques.
problem Real-world optimization problems with shared structures.
method Exploiting shared structures to enhance optimization techniques.
result Better or faster solutions through machine learning integration.
BLOSSOM optimizes switching between local and Bayesian methods for faster convergence.
problem Optimizing function evaluations efficiently and converging to global minimum.
method Combines local and Bayesian optimization with a stopping condition based on expected regret.
result Achieves superior convergence and efficient use of function evaluations.
Survey of DRO, a robust optimization framework.
problem Risk-aversion and chance-constrained optimization challenges.
method Distributionally robust optimization (DRO) framework.
result DRO's growing importance in operations research and statistics.
A novel neural network approach for optimization problems.
problem Constrained optimization problems.
method Neural Optimization Machine (NOM) using a specially designed NN architecture and training procedure.
result Solves optimization problems efficiently, especially in high-dimensional spaces.
Meta algorithm solves multivariate optimization using univariate optimizers.
problem Multivariate global optimization problems.
method Meta algorithm combining univariate global optimizers.
result Meta algorithm provides robust regret guarantees.
New algorithms ensure reproducibility and optimal convergence in convex optimization.
problem Trade-off between reproducibility and convergence rate in convex optimization.
method Regularization-based algorithms for smooth convex minimization and minimax optimization.
result Achieves optimal reproducibility and near-optimal gradient complexity for various oracle settings.
Proposes deep optimal feedback control for continuous-time systems with action constraints.
problem Learning optimal feedback control laws for robotic applications.
method Exploits Hamilton-Jacobi-Bellman equation and deep differential networks to learn optimal value function and feedback policy.
result Enables learning an optimal feedback control law that generates an optimal trajectory from any point in state-space without replanning.
New algorithm selects robust martingale for optimal stopping problems.
problem Optimal stopping problems in stochastic processes.
method Randomized dual martingale minimization algorithm.
result Efficiently selects Doob martingale as close as possible.
Optimizes stochastic and online optimization methods based on problem geometry.
problem Optimizing computational and statistical outcomes in stochastic and online optimization problems.
method Characterizes optimal methods based on constraint set and gradient geometry.
result Stochastic and adaptive-gradient methods are optimal for quadratically convex constraint sets.
Optimizes K-means clustering with PSO for better accuracy.
problem Improving the accuracy of K-means clustering.
method Uses Particle Swarm Optimization (PSO) to find optimal initial centroids for K-means.
result Optimal centroids found using PSO lead to better clustering accuracy.
Topological Bayesian Optimization finds optimal structures using topological data.
problem Optimizing complex structured data like material or neural network structures.
method Extract topological information from structures using persistent homology, apply Bayesian optimization with kernels for persistence diagrams.
result Topological information improves search efficiency for optimal structures.
This paper shows how to combine optimal tests into log-optimal processes.
problem How to combine optimal sequential tests into log-optimal processes.
method Using a new class of WAIT e-processes, the paper aggregates asymptotically optimal sequential tests into asymptotically log-optimal processes.
result It is possible to aggregate asymptotically optimal sequential tests into asymptotically log-optimal e-processes.
New algorithm AG-OG optimizes separable convex-concave problems efficiently.
problem Efficiently solving separable convex-concave minimax optimization problems.
method Leverages Nesterov acceleration and optimistic gradient on component and coupling parts of the problem.
result Achieves optimal convergence rate for various settings including bilinearly coupled problems.
Paper studies optimal control for a specific geometric problem.
problem Optimal control problem associated with the Paneitz obstacle problem.
method Existence and regularity results for optimal controls.
result Existence of optimal controls and their properties.
Adapts Bayesian optimization for mixed constraints in aircraft design.
problem Optimizing expensive black box functions with mixed constraints.
method Super efficient global optimization with upper trust bound for constraints, Gaussian process uncertainty, refinement procedure.
result Superior performance on aircraft design problem compared to state-of-the-art solvers.
Adam optimizer converges to zeros of a new vector field, not just gradient zeros.
problem Prove convergence rates for Adam optimizer in simple quadratic optimization problems.
method Introduced Adam vector field to analyze Adam optimizer's convergence.
result Established optimal convergence rates for Adam optimizer.
Novel approach learns optimal transport using convex neural networks.
problem Learning optimal transport between distributions from samples.
method Solving a minimax optimization to learn two convex functions, representing the optimal transport map.
result The approach finds optimal transport mappings that are independent of initialization and can handle discontinuous distributions.
Optimal crypto asset routing with CFMMs, including fixed costs.
problem Optimizing order execution on a network of CFMMs with fixed costs.
method Convex optimization for no fixed costs, mixed-integer convex for fixed costs, heuristics for approximate solutions.
result Approximate solutions to optimal routing and arbitrage certification problems.
BOSH optimizes functions with stochastic evaluations more efficiently and precisely.
problem Optimizing functions with noisy evaluations can lead to suboptimal solutions.
method BOSH uses a hierarchical Gaussian process to generate a growing pool of realizations.
result BOSH provides more efficient and higher-precision optimization than standard BO.
VeLO learns versatile optimizers from deep learning tasks.
problem Training deep learning models with hand-designed optimizers.
method Meta-training a neural network optimizer on a wide variety of optimization tasks.
result The learned optimizer automatically adapts to different optimization tasks without hyperparameter tuning.
New learned optimizers outperform baselines by incorporating known and novel mechanisms.
problem Understanding how learned optimizers outperform traditional ones.
method Careful analysis and visualization of learned optimizers trained on various tasks.
result Learned optimizers incorporate known techniques like momentum and gradient clipping, as well as new forms of learning rate adaptation.
Visualizes movement control optimization landscapes to understand why it's hard and how to make it easier.
problem Understanding and optimizing movement control problems in animation research.
method Novel visualizations of high-dimensional control optimization landscapes.
result Trajectory optimization becomes increasingly ill-conditioned with longer trajectories, while parameterizing control as partial target states can act as an efficient preconditioner.
A new method learns DAGs from data using permutation optimization.
problem Discovering latent DAGs from observational data.
method Optimizes over the Permutahedron to learn topological orderings and edges.
result Our method optimizes exact DAGs, is modular, and performs well on real-world data.
Deep learning approach to inverse optimization.
problem Determine parameters of an optimization process from observations.
method Unroll iterative optimization, use backpropagation to learn parameters.
result Learn coefficients for cost vector and constraints in linear programs.
Paper uses neural networks to solve complex transport problems.
problem Optimal transport and related hedging problems.
method Penalization and neural networks to solve optimization problems.
result Effective solution to multi-marginal, martingale optimal transport problems.
Develops a new method for efficient stochastic bilevel optimization.
problem Stochastic bilevel optimization problems in machine learning applications.
method Single-Timescale stochAstic BiLevEl optimization (STABLE) method.
result Achieves the same order of sample complexity as stochastic gradient descent for single-level optimization.
PAGE optimizes nonconvex problems with optimal convergence rates.
problem Nonconvex optimization problems.
method PAGE algorithm for achieving optimal convergence rates.
result PAGE achieves optimal convergence rates for nonconvex optimization.