A new algorithm selects data subsets avoiding outliers and high leverage points.
problem Outliers and high leverage points skew model estimates in subsamples.
method Unsupervised and supervised exchange procedures to select nearly D-optimal subsets.
result The new methods improve model accuracy by avoiding influential points.
A new method designs batches for Bayesian optimization more efficiently.
problem Efficiently designing batches for Bayesian optimization to reduce total time.
method Minimal Terminal Variance (MTV) acquisition function, optimizing I-optimality criterion.
result MTV designs batches more efficiently than other methods, as shown by numerical experiments.
Update rules for learning in dynamic time warping spaces are based on optimal warping paths between parameter and input time series. In general, optimal warping paths are not unique resulting in adverse effects in theory and practice. Under the assumption of squared error local costs, we show that no two warping paths …
We study a coupled system of controlled stochastic differential equations (SDEs) driven by a Brownian motion and a compensated Poisson random measure, consisting of a forward SDE in the unknown process X(t) and a \emph{predictive mean-field} backward SDE (BSDE) in the unknowns Y(t),Z(t),K(t,⋅). The driver of …
Generative approach speeds hyperparameter tuning for machine learning models.
problem Computational infeasibility of cross-validation and difficulty of fully Bayesian hyper-parameter learning.
method Combines optimization-based approximations and amortization techniques.
result Rapid evaluation of hyper-parameters over grids or ranges, supporting predictive tuning and uncertainty quantification.
Study when to replace machine learning models with new data.
problem When to switch machine learning models with new data sources.
method Unified economic and statistical framework linking learning-curve dynamics, data-acquisition, and retraining costs.
result Look-ahead sequential method outperforms other methods and approaches optimal value.
Unified approach for optimizing predictions in linear programming and inverse problems.
problem Optimizing predictions in linear programming and inverse problems.
method Maximum optimality margin approach.
result Unified approach that balances computational efficiency and theoretical properties.
This study benchmarks fifteen deep learning optimizers and identifies a subset that generally performs well.
problem Choosing the best optimizer in deep learning is challenging and often based on anecdotes.
method An extensive, standardized benchmark of fifteen popular optimizers, analyzing over 50,000 runs.
result A subset of optimizers and parameter choices generally leads to competitive results.
Estimates model performance based on compute budget and evaluates stability over time.
problem Understanding how model performance evolves with compute budget and stability over time.
method Large-scale observational evaluations, prescriptive scaling laws, smoothed quantile regression, I-optimal sampling algorithm.
result Estimates attainable accuracies and stability of model performance over time.
This work analyzes centered binary Restricted Boltzmann Machines (RBMs) and binary Deep Boltzmann Machines (DBMs), where centering is done by subtracting offset values from visible and hidden variables. We show analytically that (i) centering results in a different but equivalent parameterization for artificial neural …
This study optimizes cycle representatives in persistent homology using linear programming.
problem Non-uniqueness of cycle representatives in persistent homology creates ambiguity.
method Optimization of cycle representatives using linear programming methods.
result Optimization reduces the size of cycle representatives and is effective in most data sets.