Geotechnics adopts data-driven methods from materials informatics.
problem Soil complexity and lack of comprehensive data.
method Leveraging deep learning and transfer learning for feature extraction.
result Revolutionary potential of advanced computational tools in geotechnics.
Proposes a method to optimize neural network initialization using marginal likelihood maximization.
problem Optimizing hyperparameters for neural network initialization.
method Leverages the connection between neural networks and Gaussian processes to infer optimal hyperparameters.
result Marginal likelihood maximization provides near-optimal prediction performance on MNIST classification tasks.
Paper presents robust clustering methods for general mixture models.
problem Clustering with sub-Gaussian error assumptions often invalid in practice.
method Hybrid clustering with robust centroid estimate and data-driven initialization.
result Provably near-optimal mislabeling guarantees for general error distributions.
End-to-end framework optimizes constrained trajectories using data-driven methods.
problem Optimizing trajectories under constraints with limited dynamics knowledge.
method Data-driven approach decomposes trajectories into function basis, uses maximum a posteriori for optimization, and incorporates linear constraints.
result Commanding results in aeronautics and sailing route optimization.
SubTSBR tackles noisy data for differential equation discovery.
problem Discovering differential equations from noisy or outlier-laden data.
method Subsampling-based threshold sparse Bayesian regression (SubTSBR) with subsampling size and number of subsamples.
result SubTSBR outperforms TSBR in accuracy for differential equation discovery.
New method solves sparse deconvolution problems with theoretical guarantees and practical applications.
problem Extracting localized, recurring motifs in signals with spatial or temporal structure.
method Geometric approach using sphere constraints and data-driven initialization to derive a provable algorithm.
result Practical algorithm solves real-world deconvolution problems with good performance and generalizability.
CODE learns ODE dynamics from sparse data, outperforming neural and kernel methods.
problem Learning ODE dynamics from sparse and noisy data.
method CODE uses Polynomial Chaos Expansion (aPCE) for the ODE's RHS, enabling global orthonormal polynomial representation.
result CODE exhibits remarkable extrapolation capabilities even under novel initial conditions and measurement noise.
New methods quantify uncertainties in AI weather forecasts.
problem Uncertainty in AI weather predictions.
method Comparing ensemble and post-hoc uncertainty quantification methods.
result Probabilistic forecasts improve over ensemble physics-based models.
The paper tackles learning energies from time-evolving critical points.
problem Learnability of energies from data of critical points.
method Formulates a variational problem and uses Gamma-convergence arguments.
result Minimal solutions from finite observations converge to the exact energy.
Paper uses deep imitation learning to predict aircraft trajectories accurately.
problem Inefficient and costly Air Traffic Management system limits predictability.
method Generative Adversarial Imitation Learning framework with trajectory clustering and classification.
result Accurate predictions for entire trajectory stages, pre- and tactical.
Paper proposes a new method for designing materials using deep learning.
problem Designing high-performance material distributions from given distributions.
method Iterative process of selecting, generating, and merging material distributions using a deep generative model.
result The method improves material performance through iterative refinement.
Develops a data-driven smoothing technique for high-dimensional, non-linear panel data.
problem Improving prediction accuracy in high-dimensional, non-linear panel data models.
method Adaptive discrete smoothing with data-driven weights based on individual function similarity.
result Significant improvement in prediction accuracy compared to traditional linear panel data estimators.
FCNv2 robustness tested under noise and random initial conditions.
problem Assessing AI weather forecasting model robustness to input noise.
method Two experiments with varying noise levels and random initial conditions.
result FCNv2 preserves hurricane features under low to moderate noise, but underestimates intensity and persistence.
Data driven segmentation is an important initial step of shape prior-based segmentation methods since it is assumed that the data term brings a curve to a plausible level so that shape and data terms can then work together to produce better segmentations. When purely data driven segmentation produces poor results, the …
This paper compares model-based and model-free control methods using neural networks.
problem Comparing model-based and model-free control methods for unknown nonlinear systems.
method Utilizes Deep Koopman Representation (DKRC) and Deep Deterministic Policy Gradient (DDPG) for control.
result DKRC outperforms DDPG in terms of control strategies and accuracy for unknown dynamics.
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.
Phase segregation, the process by which the components of a binary mixture spontaneously separate, is a key process in the evolution and design of many chemical, mechanical, and biological systems. In this work, we present a data-driven approach for the learning, modeling, and prediction of phase segregation. A direct …
Paired autoencoders solve inverse problems using latent space projections.
problem Solving inverse problems in scientific computing.
method Paired autoencoder framework that projects data and quantity of interest into a latent space.
result Paired autoencoders generate multiple reconstruction metrics and enable latent-space refinement for accurate data fitting.
Method predicts multistable system states from sparse measurements.
problem Predicting multistable system states from limited data.
method Semi-supervised classification with SPML optimization.
result 95% accuracy in predicting reaction-diffusion equation states.
Data scientists guide to streamflow prediction and flood forecasting.
problem Forecasting floods and predicting streamflow volume.
method Explains hydrologic concepts and machine learning applications.
result Helps data scientists understand streamflow prediction.
Selection of appropriate collective variables for enhancing sampling of molecular simulations remains an unsolved problem in computational biophysics. In particular, picking initial collective variables (CVs) is particularly challenging in higher dimensions. Which atomic coordinates or transforms there of from a list o…
Efficiently trains GMMs for streaming data with SGD, addressing local optima and numerical instabilities.
problem Local optima and numerical instabilities in training GMMs for high-dimensional streaming data.
method Stochastic Gradient Descent (SGD) with adaptive annealing and exponential-free approximation.
result SGD approach trains GMMs without k-means initialization and outperforms sEM for high-dimensional data.
Extracts intrinsic spatial coordinates for complex agent systems to learn PDEs.
problem Modeling collective dynamics of heterogeneous agents.
method Data-driven extraction of intrinsic spatial coordinates, learning PDEs in emergent space.
result Collective dynamics can be approximated through learned PDEs in emergent coordinates.
A long-standing question for urban and regional planners pertains to the ability to describe urban patterns quantitatively. Cities' transport infrastructure, particularly street networks, provides an invaluable source of information about the urban patterns generated by peoples' movements and their interactions. With t…
Elasticity images map biomechanical properties of soft tissues to aid in the detection and diagnosis of pathological states. In particular, quasi-static ultrasonic (US) elastography techniques use force-displacement measurements acquired during an US scan to parameterize the spatio-temporal stress-strain behavior. Curr…
Model predicts asset prices from initial shocks using neural networks.
problem Missing data on actual asset liquidations limits model calibration.
method Dual neural network structure, first stage maps shocks to liquidations, second stage uses liquidations to predict prices.
result Model accurately predicts equilibrium prices from initial shocks without liquidation data.
This study analyzes decision-making in diverse environments where past data may not predict future outcomes.
problem How to make decisions when past data is not indicative of future outcomes due to unobserved confounders.
method Developed a framework to analyze and bound the performance of data-driven policies in heterogeneous environments.
result Established a method to upper bound the asymptotic worst-case regret of policies and analyzed the performance of Sample Average Approximation (SAA).
Actuaries tackle loss of earning capacity in Denmark, balancing public benefits and private insurance.
problem Balancing public benefits and private insurance for loss of earning capacity in Denmark.
method Innovative approaches from researchers and practitioners, leveraging actuarial expertise.
result Development of equitable, data-driven solutions to mitigate risk and enhance societal well-being.
New method uses SDEs for accurate non-uniformly sampled time series analysis.
problem Characterizing non-uniformly sampled time series with high accuracy.
method Stochastic Differential Equations (SDEs) for modeling, incremental estimation, and model truncation.
result Increased accuracy in characterizing non-uniformly sampled time series.
A fast method for approximate TDE in ultrasound elastography.
problem Challenging and critical step in ultrasound elastography.
method PCA-GLUE, exploiting PCA to find TDE principal components.
result PCA-GLUE is more than ten times faster than Dynamic Programming.
Quantum dynamics reveals hidden geometric structure in data.
problem Understanding complex, high-dimensional datasets through geometric structure.
method Introducing semiclassical and microlocal analysis to data analysis.
result First tractable algorithm for approximating wave dynamics and geodesics on data manifolds.
Automates PDE model reduction with time-scale separation.
problem Computational expense in solving high-dimensional PDEs.
method Combines autoencoder and time-continuous model for latent dynamics.
result Automatically learns independent temporal scales in complex systems.
The paper finds Koopman invariant subspaces using personalized PageRank.
problem Selecting a finite dictionary of observables for Koopman-invariant span.
method Exploiting zero-block structure in EDMD matrices and applying PageRank.
result Personalized PageRank can detect Koopman invariant subspaces.
Sparsity-based models and techniques have been exploited in many signal processing and imaging applications. Data-driven methods based on dictionary and sparsifying transform learning enable learning rich image features from data, and can outperform analytical models. In particular, alternating optimization algorithms …
System prioritizes rough sleeper alerts to improve outreach success.
problem Connecting rough sleepers with essential services efficiently.
method Data-driven approach prioritizing alerts based on likelihood of success.
result Increased outreach success rate by at least 15%.
Deep learning for HJB PDEs using synthetic data and residual minimization.
problem Solving Hamilton-Jacobi-Bellman PDEs for optimal control problems.
method Gradient-augmented synthetic dataset for supervised learning, residual minimization.
result Improves accuracy and efficiency of deep learning for HJB PDEs.
The paper discusses scalable learning for wireless data-driven systems.
problem Expanding data volume and model complexity limit centralized learning solutions.
method Discusses scalable architecture and local learning strategies.
result Promising research directions in scalable data-driven wireless communications.
Adaptive RBF-KAN improves KANs by dynamically adjusting kernel parameters.
problem Efficiently approximating multivariate functions using learnable univariate edge functions.
method Integrates LOOCV-based kernel scale estimation with adaptive kernel learning.
result Adaptive RBF-KAN outperforms fixed kernel KANs on various benchmark functions.
This paper reviews recent advances in the field of optimization under uncertainty via a modern data lens, highlights key research challenges and promise of data-driven optimization that organically integrates machine learning and mathematical programming for decision-making under uncertainty, and identifies potential r…
This paper bounds errors in data-driven power grid models using Rademacher complexity.
problem Ensuring accuracy of data-driven power grid models under incomplete physical information.
method Rademacher complexity theory for error bounds and evaluation implementation.
result Generalization error bounds for branch flow linearization and external network equivalent models.
A machine learning method selects optimal orthonormal bases for functional data analysis.
problem Lack of formal criteria for choosing initial orthonormal bases in functional data methods.
method Proposes a machine learning algorithm to learn and place knots for efficient orthogonal spline bases (splinets).
result Demonstrates efficiency, especially for sparse functional data and complex physical systems.
Optimal data-driven formulations are found for learning and decision-making with historical data.
problem Designing optimal learning and decision-making formulations from historical data.
method Define a yardstick for measuring formulation quality, then construct an optimal formulation that is uniformly closer to the true cost.
result Existence of three distinct out-of-sample performance regimes with corresponding optimal formulations.
TNet combines DL with physics models to solve inverse problems efficiently.
problem Solving inverse problems with limited data and physics constraints.
method Model-constrained deep learning approach using TNet.
result TNet solutions are as accurate as traditional methods but faster.
A new method for support vector regression using a data-driven insensitive parameter.
problem Determining an optimal insensitive parameter in support vector regression.
method A data-driven approach to approximate the insensitive parameter by minimizing a generalized loss function based on the likelihood principle.
result The proposed method outperforms traditional support vector regression methods and has lower computational costs.
WeatherBench provides a dataset and metrics for comparing data-driven weather forecasts.
problem Lack of a common dataset and evaluation metrics for data-driven weather forecasting.
method Publicly available dataset derived from ERA5, simple evaluation metrics.
result Baseline scores from various forecasting methods provided for comparison.
Improves data-driven reachability estimation for complex systems.
problem Estimating reachable states in complex dynamical systems with unknown parameters.
method Uses Christoffel functions and conformal prediction to improve sample efficiency and robustness.
result Guaranteed convergence to the true reach set with improved sample efficiency and robustness.
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.
Predicting stock jumps using liquidity and technical indicators.
problem Predicting intraday stock jumps in finance.
method Divide trading day into 5-minute intervals, use liquidity measures and technical indicators, apply machine learning algorithms.
result Initial evidence of predictability of jump arrivals and directions using level-2 stock data.