Paper uses autoencoders for efficient reduced-order modeling of eigenvalue problems.
problem Efficiently modeling eigenvalue problems in high dimensions.
method Autoencoder-based reduced-order modeling for eigenvalue problems.
result Autoencoder-based models outperform standard POD-Galerkin methods in neutron diffusion applications.
Develops an importance sampling estimator for complex systems.
problem Estimating the probability of QoI exceeding a threshold in complex systems.
method Coupling reduced-order model and generative model for variance reduction.
result Effective technique to reduce bias and variance in importance sampling.
This work presents a technique for statistically modeling errors introduced by reduced-order models. The method employs Gaussian-process regression to construct a mapping from a small number of computationally inexpensive `error indicators' to a distribution over the true error. The variance of this distribution can be…
Paper tackles uncertainties in reduced-order modeling of complex systems.
problem Model-form uncertainties in reduced-order modeling of complex systems.
method Combines Riemannian projection and retraction operators on a subset of the Stiefel manifold with an information-theoretic formulation.
result Identifies and quantifies the impact of model-form uncertainties on inferred operators.
A new method reduces model complexity in DMD using LARS.
problem Building accurate reduced-order models from data.
method Least Angle Regression (LARS) for Dynamic Mode Decomposition (DMD).
result LARS4DMD produces comparable performance to DMDSP with less complexity.
Novel hybrid modeling combines ML and physics for real-time diagnosis.
problem Real-time diagnosis of complex systems.
method Combines machine learning and physics-based models to create reduced-order models.
result Generated models are two orders of magnitude simpler, improving efficiency.
BayPOD-AL learns reduced-order models from high-fidelity data efficiently.
problem Capturing dynamics of complex systems with large training datasets.
method Bayesian active learning based on uncertainty-aware POD.
result BayPOD-AL reduces computational cost and improves model accuracy.
New framework quantifies uncertainty in reduced-order models for PDEs.
problem Quantifying reliability of reduced-order model predictions for PDEs.
method Combining stochastic representation of reduced bases with conformal-type methods.
result Provides prediction sets with coordinate miscoverage guarantees.
The objective of this paper is to investigate how noisy and incomplete observations can be integrated in the process of building a reduced-order model. This problematic arises in many scientific domains where there exists a need for accurate low-order descriptions of highly-complex phenomena, which can not be directly …
Artificial neural networks infer gravitational-wave parameters from reduced-order waveforms.
problem Efficiently infer gravitational-wave parameters from noisy data.
method Represent waveforms as weighted sums over reduced bases, train neural networks to map source parameters to coefficients.
result Fast and accurate interpolation of gravitational-wave coefficients.
ROMs speed up option pricing under stochastic volatility and jump-diffusion models.
problem Efficiently pricing European and American options under complex stochastic models.
method Reduced order modeling using POD and penalty method for early exercise constraints.
result Pricing with ROMs is orders of magnitude faster than full order models.
This research creates efficient models for cyclo-stationary systems using generative methods.
problem Efficiently modeling systems with periodic forcing.
method Score-based generative modeling for reduced-order models.
result Accurately reproduces statistical properties and temporal correlations of cyclo-stationary time series.
A hybrid model reduces graph complexity for improved classification accuracy.
problem High computational complexity and large number of parameters in higher-order graph convolutional networks.
method Weight sharing mechanism and novel fusion pooling layer to reduce parameters and complexity.
result The proposed model achieves highest classification accuracy with fewer trainable parameters.
New method speeds up deep neural networks inference.
problem Inference speed of deep neural networks.
method Maximum volume algorithm for reduced-order modeling.
result Convolutional layers can be replaced with smaller fully-connected layers with minimal accuracy loss.
A new method predicts non-Markovian closure terms for complex systems.
problem Predicting the effect of unresolved variables on resolved dynamics in high-dimensional systems.
method Mamba-Assisted Closure (MAC) framework: sequence model trained to predict closure from resolved trajectory, coupled with reduced-order equations.
result Substantially outperforms existing methods in predictive accuracy and long-time stability.
Paper presents ML approaches for faster brittle fracture modeling.
problem Faster modeling of brittle fracture in concrete.
method Machine learning algorithms combined with physics-based assumptions.
result ML models are orders of magnitude faster than high-fidelity models.
We show that wealth processes in the block-shaped order book model of Obizhaeva/Wang converge to their counterparts in the reduced-form model proposed by Almgren/Chriss, as the resilience of the order book tends to infinity. As an application of this limit theorem, we explain how to reduce portfolio choice in highly-re…
A model order reduction framework reduces financial risk analysis models efficiently.
problem Simulating high-dimensional financial risk models.
method Adaptive greedy sampling based on POD and surrogate modeling.
result Reduced models provide significant speedup with excellent accuracy.
This work proposes a model for geodesic distances and flows on manifolds.
problem Geodesic distances and flows on differentiable manifolds.
method Manifold-augmented Eikonal equation solutions.
result Geodesic flow provides globally length-minimizing curves.
Generative network integrates into ROM for PDEs, matching measurements and estimating uncertainties.
problem Predicting and quantifying uncertainties in numerical simulations of PDEs.
method Generative network (GN) integrated into a reduced-order model (ROM) framework for inverse problems.
result GN-based ROM efficiently quantifies uncertainty and matches measurements with high accuracy.
One popular approach to model the limit order books dynamics of the best bid and ask at level-1 is to use the reduced-form diffusion approximations. It is well known that the biggest contributing factor to the price movement is the imbalance of the best bid and ask. We investigate the data of the level-1 limit order bo…
Paper develops a method for compact Markov modeling of time series data.
problem Compact representation of time-series data with reduced memory.
method Symbolic dynamics for partitioning, hierarchical clustering for state representation, Bayesian inference for parameter identification.
result Reduced-order Markov models capture system dynamics with minimal memory.
This paper accelerates inverse solutions for PDEs using ML and ROMs.
problem Efficiently solving inverse problems governed by PDEs with many forward model solves.
method Combining ML with ROMs to improve accuracy and speed.
result ML-enhanced ROMs accelerate inverse problem solving.
New method calibrates stochastic reduced-order models from data efficiently.
problem Challenges in estimating drift and diffusion coefficients from data for high-dimensional systems.
method Uses a novel relationship between conditional score and transition density to constrain model coefficients directly from finite-lag statistics.
result Validated on various systems, the method reproduces statistical and dynamical properties of the original models.
A new model reduces the cost of simulating fluid flow through porous materials.
problem High computational cost of simulating fluid flow through porous materials.
method Proposes a fully probabilistic, Darcy-type reduced-order model.
result The model significantly accelerates uncertainty quantification tasks.
New method learns nonlinear projections for reduced-order modeling of complex dynamical systems.
problem Modeling transient dynamics near a manifold in nonlinear systems.
method Constrained autoencoder neural networks with invertible activation functions and biorthogonal weight matrices.
result Demonstrated effectiveness on a vortex shedding model, learning oblique fibers for fast dynamics.
Study reduces financial dynamics complexity using PCA for NASDAQ, oil, gold, and USD.
problem Understanding complex financial interactions among multiple assets.
method Time-delay embedding and PCA for dimensionality reduction, followed by linear regression.
result Limited number of principal components capture dominant dynamics of each asset.
Paper presents ZO-SVRG for faster nonconvex optimization.
problem Gradient-free optimization challenges in nonconvex settings.
method Comprehensive theoretical analysis, novel ZO-SVRG algorithm, accelerated versions.
result ZO-SVRG achieves best rate for ZO stochastic optimization.
Data whitening and second order optimization harm generalization by reducing access to dataset information.
problem Harmful effects of data whitening and second order optimization on generalization in machine learning.
method Analysis of fully connected models and experimental verification.
result Data whitening and second order optimization reduce or prevent generalization by limiting access to dataset information.
New method uses low-fidelity data to improve neural network predictions.
problem Improving predictive capability of neural networks for parameterized problems.
method Combines POD and shallow neural network; incorporates low-fidelity data features.
result Improves predictive capability of neural network predictions.
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.
Paper extends credit portfolio valuation under model uncertainty for multiple default times.
problem Valuation of credit portfolio derivatives under model uncertainty for multiple default times.
method Introduces a sublinear conditional operator for a family of probability measures.
result Generalizes results for single default time to multiple default times.
Algorithm learns latent variables for thermodynamically-consistent deep neural networks.
problem Predicting time evolution of large-scale physical systems with thermodynamic consistency.
method Sparse autoencoders and structure-preserving neural networks.
result Method conserves total energy and entropy inequality for both conservative and dissipative systems.
Improved latent dynamics identification framework reduces training time and improves accuracy.
problem Accurate numerical solutions of partial differential equations require computationally expensive solvers.
method Sequential decoder training (mLaSDI) to correct residual errors from previous stages.
result mLaSDI consistently outperforms standard LaSDI, achieving lower prediction errors and reduced training time.
Extends RRR to capture nonlinear interactions in multi-response regression.
problem Complex relationships in real-world data cannot be adequately modeled by linear interactions.
method Introduces Higher Order Reduced Rank Regression (HORRR) using tensor representations and Tucker decomposition.
result HORRR can capture nonlinear interactions in multi-response regression.
Paper introduces techniques to learn higher-order programs, improving predictive accuracy and reducing learning times.
problem Expressing and learning complex programs in ILP.
method Extending meta-interpretive learning to support higher-order definitions as background knowledge.
result Learning higher-order programs reduces hypothesis space and sample complexity, improving predictive accuracy and reducing learning times.
Paper uses neural networks to speed up simulations of complex systems.
problem Rapid simulations of advection-dominated problems in engineering and geophysics.
method Recurrent neural network for approximating nonlinear component of ROM.
result The proposed framework accurately recovers transient dynamics without full nonlinear computations.
First-order scattering reduces CNN input size while maintaining classification accuracy.
problem Reducing the input size of CNNs for faster inference and lower memory usage.
method First-order scattering transform applied to CNN inputs.
result Cascaded CNN with scattering transform achieves similar ImageNet classification performance.
GyroSwin models plasma turbulence with neural nets, reducing costs and capturing neglected nonlinearities.
problem Understanding plasma turbulence in fusion reactors, which impairs confinement and limits reactor design.
method Introduces GyroSwin, a scalable 5D neural surrogate that approximates 5D nonlinear gyrokinetic simulations.
result GyroSwin outperforms reduced models in heat flux prediction and captures turbulent energy cascade.
A new hybrid-ordered SGD method reduces communication and complexity for non-convex optimization.
problem Balancing communication, computational complexity, and convergence rate in distributed non-convex optimization.
method Hybrid-ordered distributed SGD with pre-shared scalers and periodic vector communication.
result Order-wise faster convergence compared to existing methods.
A tensor-based model reduces weight parameters and spatial structure for high-order data classification.
problem High-order data classification with limited training samples and preserved spatial structure.
method Rank-1 FNN model based on modified feedforward neural network with rank-1 canonical decomposition and new learning algorithm.
result The proposed model outperforms state-of-the-art methods, especially in cases with small training samples.
Market makers reduce price spread in a simple limit order book model.
problem Unrealistically large spread in a simple limit order book model.
method Introduced market makers that place both buy and sell limit orders at current bid and ask prices.
result Market makers reduce spread to a rate that closes it completely.
ROAD-EnKFs use learned low-dimensional models to improve state reconstruction and forecasting.
problem Reconstructing and forecasting states of unknown or expensive systems.
method Learned low-dimensional surrogate models and ensemble Kalman filter integration.
result ROAD-EnKFs achieve higher accuracy at lower computational cost than existing methods.
A computational theory reduces agent evaluation errors and speeds up processes.
problem Efficient evaluation of mini agents at reduced cost.
method Developed a computational theory and a meta-learner to handle heterogeneous agents.
result Reduced evaluation errors by 24.1% to 99.0% across various scenarios.
Study adapts liquidity model to equity auctions, revealing accelerated event rates and reduced price impact.
problem Understanding and predicting price dynamics in equity auctions.
method Adapted latent/revealed order book framework to equity auctions, measuring order submissions, cancellations, and diffusion rates.
result Equity auctions exhibit accelerated event rates leading to reduced price impact and decreased volatility.
Optimal market making strategy with price forecasts reduces inventory costs and spreads.
problem Optimal market making strategy with price forecasts reduces inventory costs and spreads.
method Modeling market making strategy with linear price impact, random slope and intercept, and simultaneous order arrivals.
result Simultaneous order arrivals and price forecasts reduce inventory costs and spreads.
Optimized variable orderings improve autoregressive model performance.
problem Challenges in variable ordering affect autoregressive model efficiency.
method Learn graphical model structure to inform optimal variable orderings.
result Graph-informed orderings yield higher-fidelity samples.
New method uses higher-order Langevin dynamics for efficient parallel sampling.
problem Efficient parallel sampling from high-dimensional log-concave distributions.
method Combines higher-order Langevin dynamics with blockwise Lagrange polynomial interpolation.
result Reduces the number of parallel points required for a target accuracy.