Simulation of high-speed train aerodynamics using RANS and machine learning.
problem Aerodynamic analysis of high-speed trains under turbulent flow conditions.
method RANS equations with turbulence model, machine learning (GEP, GPR, RF) for predictions.
result Random Forest (RF) provides the most accurate predictions for aerodynamic coefficients.
GPU speeds up Monte Carlo simulations for large time steps.
problem Slow convergence and inaccurate solutions with large time steps in Monte Carlo simulations.
method Generalizes the Seven League scheme for GPU acceleration.
result Significantly improved computational speed.
Hybrid model speeds up galaxy simulations by incorporating baryonic properties.
problem Inaccurate baryonic properties in dark matter-only simulations.
method Combining analytic models and machine learning for faster, more accurate simulations.
result Hybrid model outperforms machine learning alone for some baryonic properties.
Approximate multipliers boost CNN training speed, power, and area at slight accuracy cost.
problem Improving CNN training performance in terms of speed, power, and area.
method Simulation of approximate multipliers' impact on CNN training, hybrid training method combining approximate and exact multipliers.
result Using approximate multipliers for most of training enhances speed, power, and area with minimal accuracy loss.
Objective: Ultrasound elastography is gaining traction as an accessible and useful diagnostic tool for such things as cancer detection and differentiation and thyroid disease diagnostics. Unfortunately, state of the art shear wave imaging techniques, essential to promote this goal, are limited to high-end ultrasound ha…
Faster trading algorithms aren't always better, as shown in simulated financial markets.
problem The impact of reaction time on automated trading performance.
method Simulated financial markets with a single exchange, public limit order book, and continuous double auction matching. Models of trading speed and computation times of trading algorithms were introduced and profiled.
result Trading performance is impacted by speed, and the Adaptive-Aggressive (AA) algorithm is outperformed by the Shaver (SHVR) strategy when relative computation times are accurately simulated.
Novel deep learning approach for fast, differentiable fluid simulations.
problem Challenges in solving incompressible fluid dynamics equations efficiently.
method Physics-constrained training approach for convolutional neural networks.
result Trained models can handle various fluid phenomena and offer fast simulations.
We study polygonal analogues of several moving boundary problems and their time discretization which preserves the constant area speed property. We establish various polygonal analogues of geometric formulas for moving boundaries and make use of the geometric formulas for our numerical scheme and its analysis of genera…
GPU speeds up derivatives sensitivity computation for Heston model options.
problem Efficient computation of option Greeks under the Heston model.
method Implemented exact simulation and novel Milstein discretisation methods on GPU.
result GPU speeds up Greeks computation up to 200x compared to CPU methods.
Quantum algorithm reduces qubit usage for Monte Carlo simulations.
problem High qubit requirements for Monte Carlo simulations on quantum computers.
method Use of pseudo-random number generator (PRNG) on a quantum circuit.
result Significant reduction in qubit usage without sacrificing quantum speed.
Generating eye diagrams by using a circuit simulator can be very computationally intensive, especially in the presence of nonlinearities. It often involves multiple Newton-like iterations at every time step when a SPICE-like circuit simulator handles a nonlinear system in the transient regime. In this paper, we leverag…
In recent years, the interest in leveraging quantum effects for enhancing machine learning tasks has significantly increased. Many algorithms speeding up supervised and unsupervised learning were established. The first framework in which ways to exploit quantum resources specifically for the broader context of reinforc…
This paper studies parallelization schemes for stochastic Vector Quantization algorithms in order to obtain time speed-ups using distributed resources. We show that the most intuitive parallelization scheme does not lead to better performances than the sequential algorithm. Another distributed scheme is therefore intro…
Gradient flow preserves speed for integral Menger curvature curves.
problem Optimizing curves with integral Menger curvature constraints.
method Projected Sobolev gradient flow in Hilbert space.
result Long-time existence and C1,1-bounds for the flow. Extends driving model to control agent behavior in simulations.
problem Simulate realistic driving behavior for autonomous systems.
method Introduces Control-ITRA method to influence agent behavior through waypoint assignment and target speed modulation.
result Demonstrates controllable, infraction-free trajectories while preserving realism.
Deep neural network reconstructs traffic speeds from sparse vehicle data.
problem Reconstructing traffic speeds from limited probe vehicle data.
method Convolutional neural network architecture for spatio-temporal learning.
result The method can reconstruct traffic speeds with low probe vehicle penetration.
Probabilistic SR method speeds up high-fidelity simulations with reliable uncertainty estimates.
problem Lack of reliable uncertainty quantification in deep-learning based SR methods.
method Statistical Finite Element Method and energy-based generative modeling.
result Efficient high-resolution predictions with inherent uncertainty estimates.
DVAEs speed up calorimeter simulation for LHC data.
problem Slow calorimeter simulation in LHC experiments.
method Discrete Variational Autoencoders (DVAEs).
result Significantly faster calorimeter shower simulation.
SparseProp speeds up SNN simulations and training by four orders of magnitude.
problem Efficiently simulating and training large spiking neural networks.
method Event-based algorithm that reduces computational cost from O(N) to O(log(N)) per spike.
result Numerically exact simulations of large spiking networks and efficient training using backpropagation.
CESAR improves wind speed and power forecasting for high-resolution simulations.
problem Accurate high-resolution wind forecasting for efficient power grid management.
method A spatio-temporal neural network model using deep convolutional autoencoder and echo state network.
result CESAR provides up to 17% improvement in wind speed and power forecasting compared to best alternatives.
GenFormer uses deep learning to generate complex stochastic data.
problem Creating synthetic stochastic data that matches real-world statistical properties.
method Transformer-based deep learning model that maps Markov state sequences to time series values.
result GenFormer preserves target marginal distributions and other statistical properties in multivariate spatio-temporal data.
We present an easily implemented, fast, and accurate method for approximating extreme quantiles of compound loss distributions (frequency+severity) as are commonly used in insurance and operational risk capital models. The Interpolated Single Loss Approximation (ISLA) of Opdyke (2014) is based on the widely used Single…
Variable speed limits (VSL) control is a flexible way to improve traffic condition,increase safety and reduce emission. There is an emerging trend of using reinforcement learning technique for VSL control and recent studies have shown promising results. Currently, deep learning is enabling reinforcement learning to dev…
New RL approach speeds up training across tasks.
problem Training reinforcement learning models quickly and efficiently.
method Combines planning quasi-metric and task-specific aimers.
result Achieves multiple-fold speed-up on bit-flip and robotic arm tasks.
We present a hybrid continuum-atomistic scheme which combines molecular dynamics (MD) simulations with on-the-fly machine learning techniques for the accurate and efficient prediction of multiscale fluidic systems. By using a Gaussian process as a surrogate model for the computationally expensive MD simulations, we use…
Speeds up complex portfolio exposure calculations.
problem Calculating exposure of portfolios with exotic derivatives.
method Least Squares Monte Carlo (LSMC) technique.
result Significantly reduces computation time for nested Monte Carlo.
Improved convergence speed of principal component analysis through modified learning rules.
problem Slow convergence for covariance matrices with close eigenvalues.
method Introduced an additional term to the objective function to mitigate convergence issues.
result Significantly improved convergence speed confirmed through simulations.
The well-known Ising model used in statistical physics was adapted to a social dynamics context to simulate the adoption of a technological innovation. The model explicitly combines (a) an individual's perception of the advantages of an innovation and (b) social influence from members of the decision-maker's social net…
Simulation-based inference speeds up gravitational wave data analysis.
problem High-dimensional parameter spaces and complex noise in gravitational wave data.
method Simulation-based inference methods using machine learning techniques.
result Simulation-based inference methods improve speed over traditional methods.
Machine learning speeds up quantum chemical calculations of excited states.
problem Accurate quantum chemical calculations of excited states are computationally expensive.
method Employing machine learning to speed up and advance excited-state simulations in various fields.
result Machine learning techniques can significantly reduce computational time for excited-state simulations.
How to reconcile the classical Heston model with its rough counterpart? We introduce a lifted version of the Heston model with n multi-factors, sharing the same Brownian motion but mean reverting at different speeds. Our model nests as extreme cases the classical Heston model (when n = 1), and the rough Heston model (w…
Enhances supervised learning speed with KT algorithm.
problem Speed up supervised learning tasks with minimal loss.
method Generalizes kernel thinning to supervised learning, combining NW and KRR with KT.
result KT-based estimators offer superior computational and statistical efficiency.
A new method quantifies input model uncertainty in streaming data.
problem Quantifying input model uncertainty in streaming data.
method Two-layer importance sampling framework for online uncertainty quantification.
result Consistency and asymptotic convergence rate of the proposed algorithms.
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.
Method generates random numbers from sensor noise, improving accuracy and speed.
problem Improving accuracy and speed of Monte Carlo integration.
method Sampling a physical process in a controlled environment.
result Reduces error of Monte Carlo integration by 10^68 times while doubling speed.
Surrogate models speed up RL training in dynamic systems.
problem High computational cost of high-fidelity simulations.
method Developed and tested surrogate models for RL training.
result Surrogate models can significantly accelerate RL training.
New algorithm tackles resource allocation in multi-armed bandits to balance speed and throughput.
problem Balancing speed and throughput in stochastic multi-armed bandits with limited resources.
method Proposes an algorithm that trades off between information accumulation and throughput.
result Upper bounds the time taken to find the best arm with a given target success probability.
Efficiently trains forward processes to minimize generative trajectories curvature.
problem High curvature of generative trajectories slows down sampling speed.
method Trains forward process to minimize curvature without ODE/SDE simulation.
result Lower curvature than previous models, decreased sampling costs.
Distributed securities exchanges may become de facto fragmented if they span geographical regions with asymmetric computer infrastructure. First, we build an economic model of a decentralized exchange with two miner clusters, standing in for compact areas of economic activity (e.g., cities). "Local" miners in the area …
A new eigenvalue-based method speeds up Monte Carlo simulations.
problem Reducing the number of paths needed for accurate Monte Carlo simulations.
method Eigenvalue-based approximation of Markov Chain Monte Carlo.
result Significant variance reduction and comparable results to traditional Monte Carlo.
The paper uses deep learning to speed up spatial and visual connectivity analysis.
problem Slow calculation of spatial and visual connectivity metrics.
method Investigates machine learning models and a pipeline for training them on spatial and visual connectivity analysis.
result Deep learning models significantly speed up the analysis process.
Study shows time matters in automated trading, improving simple strategies over complex ones.
problem Effects of reaction speed and trading urgency on automated trading strategies.
method Simulated financial markets with public limit order book and continuous double auction matching. Examined reaction speed and trading urgency.
result Simple strategies outperform complex ones when considering reaction speed and trading urgency.
This paper improves simulation methods for rough Volterra stochastic volatility models.
problem Inefficient techniques in Monte-Carlo simulations for rough Volterra volatility models.
method Comparison and modification of three simulation methods: Cholesky, Hybrid, and rDonsker schemes.
result Suggests modifications to improve simulation accuracy and efficiency.
We propose a simulation method for multidimensional Hawkes processes based on superposition theory of point processes. This formulation allows us to design efficient simulations for Hawkes processes with differing exponentially decaying intensities. We demonstrate that inter-arrival times can be decomposed into simpler…
Automates phased release strategy to balance risk and speed.
problem Balancing risk and speed in phased product releases.
method Formalizes as constrained batched bandit problem, uses adaptive Bayesian approach.
result Proposes algorithm that determines optimal release percentages.
This study proposes a framework for human-like autonomous car-following planning based on deep reinforcement learning (deep RL). Historical driving data are fed into a simulation environment where an RL agent learns from trial and error interactions based on a reward function that signals how much the agent deviates fr…
Federated Learning speeds up speech recognition training by 7x and reduces error rate by 6%.
problem Training acoustic models for speech recognition tasks in a federated manner.
method Hierarchical optimization and dynamic gradient aggregation methods.
result Significant improvement in training convergence speed and model performance.
R2D2-GANs generate high-resolution images at real-time speed.
problem Generating high-resolution images at real-time speed.
method Conditional recursive GANs architecture.
result Synthesized images are indistinguishable from real ones.