Data-driven method for error estimation without needing class complexity.
problem Constructing confidence intervals for a class of estimates.
method Data-driven approach to derive high-probability upper bounds on maximum error.
result Method naturally adapts to unknown correlation structures and works for finite and infinite classes.
Adaptive BO improves solder joint reliability by 3% with half the computational cost.
problem Improving solder joint reliability under thermomechanical loading.
method Adaptive Bayesian optimization with Gaussian process regression.
result Adaptive BO outperforms regular BO by 3% on average at any given computational budget.
Study compares data-driven vs model-based MRS quantification strategies, focusing on resilience to out-of-distribution effects.
problem Resilience to out-of-distribution effects in data-driven MRS quantification.
method Compared three data-driven strategies (supervised regression, self-supervised learning, test-time adaptation) against model-based fitting tools.
result Test-time adaptation proved most resilient to out-of-distribution effects, while self-supervised learning achieved intermediate performance.
Learn to automatically plug domain-specific modules into a common network.
problem Learning inflexibility and computational intensiveness in multi-domain learning.
method Neural Architecture Search (NAS) for data-driven adapter plugging and structure design.
result NAS-driven MDL model achieves comparable performance to existing approaches.
Improved MCMC sampling for expensive, irregular likelihoods.
problem Bayesian inference challenges with irregular, expensive likelihoods.
method Adapt subset samplers, introduce data-driven proxies, adaptive controller.
result Improved HINTS algorithm achieves best sampling error in fixed budget.
Paper presents a data-driven method for option pricing.
problem Option pricing accuracy under market volatility.
method Data-driven ensemble approach based on no-arbitrage theory.
result Model performance validated with real data.
Paper develops adaptive models for robust energy forecasting with missing data.
problem Operational models assume complete data; missing data can degrade forecast accuracy.
method Adaptive robust optimization and adversarial machine learning for missing data.
result Proposed models perform well even with short-term missing data and significantly outperform imputation with longer-term missing data.
ADML combines debiased learning with data-driven model selection for efficient inference.
problem Debiased machine learning estimators can be unstable and biased in nonparametric models.
method Data-driven model selection techniques combined with debiased machine learning.
result ADML estimators yield superefficient inference for pathwise differentiable parameters.
Framework improves data-driven ROMs for complex systems using Bayesian operator inference.
problem Improving the quality of data-driven reduced-order models for complex dynamical systems.
method Develops an active learning framework using Bayesian operator inference to identify and select training parameters.
result The proposed adaptive sampling strategy consistently yields more stable and accurate ROMs than random sampling.
CoLoRA models predict PDE solutions quickly and accurately with minimal data.
problem Efficiently modeling PDE solutions with limited data.
method Continuous low-rank adaptation of neural networks trained on offline data.
result Predictions are orders of magnitude faster and more accurate than classical methods.
Money analyzed as a multidimensional tensor for better economic policy.
problem Economic complexity and policy responsiveness.
method Tensor analysis of money dynamics.
result Enhanced economic policy design and resilience.
CoDA adapts dynamics models to new physical systems by conditioning on context.
problem Generalizing to new physical systems with shared dynamics but different contexts.
method Context-informed dynamics adaptation (CoDA) using multiple environments and a hypernetwork.
result State-of-the-art generalization results on nonlinear dynamics.
ERFit identifies dynamic equations from data with minimal supervision.
problem Data-driven sparse system identification in science and engineering.
method Entropic Regression method.
result ERFit package simplifies sparse system identification for various applications.
Paper optimizes estimation of quadratic functionals in nonparametric IV models.
problem Optimal estimation of a nonlinear functional in ill-posed inverse regression.
method Adaptive, minimax estimation using leave-one-out, sieve NPIV estimator with data-driven sieve dimension selection.
result Adaptive estimator achieves minimax optimal rate in various ill-posed cases.
Feature extraction from persistence diagrams, as a tool to enrich machine learning techniques, has received increasing attention in recent years. In this paper we explore an adaptive methodology to localize features in persistent diagrams, which are then used in learning tasks. Specifically, we investigate three algori…
The paper tackles robust control with uncertain dependence using data-driven methods.
problem Nonparametric robust control under dependence uncertainty in multi-period stochastic systems.
method Nonparametric adaptive robust control framework using stochastic gradient descent ascent algorithm.
result The controller benefits from knowing more about the uncertain model.
Optimal asset allocation strategy outperforms stochastic benchmark.
problem Achieving higher terminal wealth than a stochastic benchmark.
method Data-driven Neural Network optimization framework for dynamic asset allocation.
result Optimal adaptive strategy outperforms benchmark with higher median and right-skewed terminal wealth.
Physics-consistent method improves seismic inversion accuracy.
problem Challenges in seismic full-waveform inversion (FWI) due to ill-posedness and high cost.
method Hybrid approach combining physics-based models with data-driven methodologies, incorporating physics into data augmentation.
result Physics-consistent data-driven inversion yields higher accuracy and better generalization.
Probabilistic methods improve SHM by learning from noisy, incomplete data.
problem Noisy and incomplete SHM data, lack of prior labels.
method Probabilistic algorithms for semi-supervised, active, and multi-task learning.
result Probabilistic methods enhance SHM by incorporating new data.
Recently, (Blanchet, Kang, and Murhy 2016, and Blanchet, and Kang 2017) showed that several machine learning algorithms, such as square-root Lasso, Support Vector Machines, and regularized logistic regression, among many others, can be represented exactly as distributionally robust optimization (DRO) problems. The dist…
In this paper we consider the basic version of Reinforcement Learning (RL) that involves computing optimal data driven (adaptive) policies for Markovian decision process with unknown transition probabilities. We provide a brief survey of the state of the art of the area and we compare the performance of the classic UCB…
We consider the problem of efficiently approximating and encoding high-dimensional data sampled from a probability distribution ρ in RD, that is nearly supported on a d-dimensional set M - for example supported on a d-dimensional Riemannian manifold. Geometric Multi-Resolution Analysis (GM…
In Prognostics and Health Management (PHM) sufficient prior observed degradation data is usually critical for Remaining Useful Lifetime (RUL) prediction. Most previous data-driven prediction methods assume that training (source) and testing (target) condition monitoring data have similar distributions. However, due to …
The paper introduces a new model selection criterion for various time series models.
problem Designing adaptive model selection criteria for a wide range of time series models.
method The approach involves a penalized contrast akin to Hannan and Quinn's criterion, with a data-driven calibrated term.
result The new criteria select the true model almost surely asymptotically for a wide range of time series models.
KOMET identifies Koopman operators from model parameter trajectories to adapt to evolving data distributions.
problem Adaptation of parametric models to non-stationary environments.
method Data-driven framework using Koopman operator identification and Extended Dynamic Mode Decomposition (EDMD).
result KOMET achieves high autonomous-rollout accuracies of 0.981 to 1.000 over 100 time steps on various drifting datasets.
The present paper proposes generalized Gaussian kernel adaptive filtering, where the kernel parameters are adaptive and data-driven. The Gaussian kernel is parametrized by a center vector and a symmetric positive definite (SPD) precision matrix, which is regarded as a generalization of the scalar width parameter. These…
Machine learning improves combustion system predictions by integrating physical models.
problem Improving accuracy of complex multi-physics systems like combustion.
method Coupling machine learning algorithms with physical models and constraints.
result Enhanced predictive capabilities in turbulent combustion.
A new line search rule improves support recovery in high-dimensional data.
problem Support recovery in high-dimensional data analysis with ℓ0 penalty. method Data-driven line search rule for adaptive step size determination.
result Proves ℓ2 error bound without restrictions on cost functional. We derive and analyze a generic, recursive algorithm for estimating all splits in a finite cluster tree as well as the corresponding clusters. We further investigate statistical properties of this generic clustering algorithm when it receives level set estimates from a kernel density estimator. In particular, we derive…
Flexible multi-task learning framework using summary statistics.
problem Data-sharing constraints in healthcare settings.
method Proposes a flexible multi-task learning framework utilizing summary statistics and adaptive parameter selection.
result Systematic non-asymptotic analysis and simulations demonstrate the method's performance.
Bayesian autoencoders discover physics from noisy data.
problem Challenges in identifying governing equations and coordinates from noisy, low-data real-world data.
method Bayesian SINDy autoencoders with hierarchical Bayesian sparsifying prior and adaptive empirical Bayesian method.
result Better physics discovery with lower data and fewer training epochs, along with valid uncertainty quantification.
Bayesian adaptive PCE method improves surrogate modeling and sensitivity analysis.
problem Lack of fully Bayesian PCE methods in statistics.
method Developed a novel fully Bayesian adaptive PCE method with R implementation.
result Bayesian adaptive PCE provides competitive performance for various UQ tasks.
A heuristic minimizes tardy jobs' total weight on single-machine scheduling.
problem Minimizing tardy jobs' total weight on single-machine scheduling.
method Data-driven heuristic combining machine learning and problem-specific characteristics.
result Significantly outperforms state-of-the-art in optimality gap and adaptability.
DINo forecasts PDEs with flexible extrapolation and adaptability.
problem Fixed discretizations limit real-world PDE forecasting.
method DINo uses implicit neural representations for continuous-time dynamics.
result DINo outperforms other neural PDE forecasters.
New data-driven Cartan connection tracks complex vascular structures.
problem Tracking complex vascular structures in multi-orientation images.
method Formulated a data-driven Cartan connection on M2 for geodesic tracking. result Improved geodesic tracking of vascular trees with globally optimal curves.
Deep neural networks and decision trees operate on largely separate paradigms; typically, the former performs representation learning with pre-specified architectures, while the latter is characterised by learning hierarchies over pre-specified features with data-driven architectures. We unite the two via adaptive neur…
Generative model emulates climate model for 100-year forecasts.
problem Challenges in accurately simulating long-term climate data.
method Integrates DYffusion with SFNO for stable, accurate climate simulations.
result Achieves near gold-standard performance for climate model emulation.
Deep-HGP uses Bayesian nonparametric approach for complex data regression.
problem Complex data regression with compositional structures.
method Deep Gaussian processes with a squared-exponential kernel, data-driven lengthscale parameters.
result Posterior distribution optimally recovers unknown true regression curve in terms of quadratic loss.
New estimator achieves minimax optimal risk in transfer learning.
problem Nonparametric regression with transfer learning.
method Confidence thresholding estimator and data-driven adaptive algorithm.
result Adaptive algorithm achieves minimax risk up to a logarithmic factor.
We present an efficient algorithm for model-free episodic reinforcement learning on large (potentially continuous) state-action spaces. Our algorithm is based on a novel Q-learning policy with adaptive data-driven discretization. The central idea is to maintain a finer partition of the state-action space in regions w…
Domain Adaptation in 6G wireless networks: When is it green?
problem Energy consumption of Domain Adaptation (UDA) compared to single-task training in 6G wireless networks.
method Investigate energy consumption and propose a method to determine the minimum number of target domains for UDA to be more energy-efficient than retraining.
result Proposed a method to determine the minimum number of target domains for UDA to be more energy-efficient than retraining.
A typical domain adaptation approach is to adapt models trained on the annotated data in a source domain (e.g., sunny weather) for achieving high performance on the test data in a target domain (e.g., rainy weather). Whether the target contains a single homogeneous domain or multiple heterogeneous domains, existing wor…
We develop a data driven approach to perform clustering and end-to-end feature learning simultaneously for streaming data that can adaptively detect novel clusters in emerging data. Our approach, Adaptive Nonparametric Variational Autoencoder (AdapVAE), learns the cluster membership through a Bayesian Nonparametric (BN…
A new framework optimizes manufacturing decisions with less data and time.
problem Optimizing complex systems with multiple conflicting objectives.
method Data-driven Bayesian optimization using sequential learning.
result The proposed algorithm achieves the actual Pareto front with less data.
This paper tackles regularization parameter learning in inverse problems using data-driven bilevel optimization.
problem Finding optimal regularization parameters in inverse problems.
method Data-driven bilevel optimization approach, analyzing performance in large data samples.
result The approach can reduce computational cost through online numerical schemes based on stochastic gradient descent.
Paper tackles singularity detection in PDEs using data-driven self-supervised learning.
problem Detecting singularities in PDE solutions for efficient numerical methods.
method Data-driven self-supervised learning framework with filtering tasks.
result Proposes filtering methods for raw unlabeled data to improve singularity detection.
This work improves algorithm design for structured Pfaffian settings.
problem Designing algorithms for specific application domains with theoretical guarantees.
method Data-driven algorithm design using hyperparameter tuning and learning guarantees.
result Introduced the Pfaffian GJ framework for providing learning guarantees for Pfaffian function classes.
Paper proposes a DNN-driven AF framework for improved generalization.
problem Generalization challenge in adaptive filtering.
method Structural embedding of DNN into AF system, using maximum likelihood as implicit cost function.
result Demonstrates improved generalization capability through extensive experiments.