XGBoost outperforms other boosting techniques in training speed and generalization performance.
problem Comparing XGBoost with other boosting techniques.
method Comprehensive comparison of XGBoost, random forests, and gradient boosting using tuned and default models.
result XGBoost is not always the best choice under all circumstances.
Enhances time series comparison by simplifying warping paths.
problem Lack of qualitative comparison on top of elastic distance measures.
method Proposes a technique to simplify warping paths for better visualization and interpretation.
result Clearer representation of how subsequences match between time series.
Proposes a deep reinforcement learning model for efficient variable speed limits control.
problem Improving traffic flow, safety, and emissions on freeways with varying speed limits.
method Uses a novel actor-critic architecture for deep reinforcement learning to manage dynamic speed limits.
result The proposed method enhances efficiency, safety, and emissions compared to traditional control methods.
New method combines model forecasts and real-time observations for hourly wind speed predictions.
problem Filling the six-hour gap between weather model runs for accurate hourly wind speed forecasts.
method Combines quasi-real-time observed wind speed and weather model predictions using a novel Ensemble Model Output Statistics (EMOS) strategy.
result Successfully improved wind speed predictions compared to observed data from SYNOP stations.
This study compares Matlab and OpenCV for machine learning algorithms.
problem Comparing execution speeds of Matlab and OpenCV for machine learning.
method 20 real datasets, 20 different machine learning algorithms.
result OpenCV is significantly faster than Matlab in execution.
Gaussian process regression (GPR) is a non-parametric Bayesian technique for interpolating or fitting data. The main barrier to further uptake of this powerful tool rests in the computational costs associated with the matrices which arise when dealing with large data sets. Here, we derive some simple results which we h…
Study investor attention using search volume data before and after mobile device popularity.
problem Accurately measure investor attention in a fast-paced market.
method Compare investor attention using search volume data before and after mobile device popularization.
result Investor attention measured using search volume data is more accurate and faster after mobile device popularization.
This paper compares FAISS and FENSHSES for nearest neighbor search in Hamming space.
problem Comparing nearest neighbor search systems in Hamming space.
method Comprehensive evaluations of indexing speed, search latency, and RAM consumption.
result Better understanding of trade-offs between main memory and secondary memory systems.
Optimal execution method uses rough path signatures for approximate solutions.
problem Finding optimal trading speed in financial markets.
method Approximate solutions via signature method for geometric rough paths and continuous price impact.
result Accurate and flexible optimal trading speed solutions for various market conditions.
New method speeds up knot computations in 3D.
problem Computational complexity in knot theory.
method 3D representation of knots for faster computation.
result Savings in computational complexity for knot invariants.
Divergence estimators based on direct approximation of density-ratios without going through separate approximation of numerator and denominator densities have been successfully applied to machine learning tasks that involve distribution comparison such as outlier detection, transfer learning, and two-sample homogeneity…
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.
We consider data in the form of pairwise comparisons of n items, with the goal of precisely identifying the top k items for some value of k < n, or alternatively, recovering a ranking of all the items. We analyze the Copeland counting algorithm that ranks the items in order of the number of pairwise comparisons won, an…
Study reveals a link between Ruelle-Pollicott resonances and cohomology eigenvalues for Anosov diffeomorphisms.
problem Understanding the speed of mixing in Anosov diffeomorphisms.
method Investigates Ruelle-Pollicott resonances on manifolds of any dimension, connecting them to cohomology eigenvalues of a quasi-compact transfer operator.
result Established a cohomological bound for the speed of mixing of Anosov diffeomorphisms.
Fast AutoAugment speeds up data augmentation search.
problem Efficiently searching for effective data augmentation policies.
method Density matching-based search strategy.
result Comparable performance with faster search time.
New syllabuses improve LSTM learning speed but not generalization.
problem Comparing syllabuses for curriculum learning in LSTM networks.
method Empirical comparison of identified syllabuses on three sequential learning tasks.
result Automated curriculum learning approach performs competitively.
Machine learning accelerates Lie algebra computations.
problem Computing tensor products and branching rules of Lie algebras.
method Machine learning for Lie algebra computations.
result Achieves significant speed-ups in Lie algebra computations.
Multirate training speeds up neural network fine-tuning.
problem Efficiently fine-tuning deep neural networks.
method Partitioning neural network parameters into fast and slow parts, updating slowly over longer intervals.
result Significant computational speed-up for transfer learning tasks.
We study the optimal execution of market and limit orders with permanent and temporary price impacts as well as uncertainty in the filling of limit orders. Our continuous-time model incorporates a trade speed limiter and a trader director to provide better control on the trading rates. We formulate a stochastic control…
New method for generating images with conditional probability models.
problem Generating images with specific conditions.
method Score-based diffusion models with theoretical analysis and new estimator.
result New estimator for conditional score performs similarly to state-of-the-art.
AdaScale SGD adapts learning rates for large-batch training efficiently.
problem Adapting learning rates for large-batch training to balance speed-ups and model quality.
method Adaptive learning rate adaptation based on gradient variance.
result AdaScale achieves reliable speed-ups for a wide range of batch sizes without degrading model quality.
Machine learning speeds up search procedures for sorted tables.
problem Improving the speed of sorted table search procedures.
method Systematic experimental comparison of efficient implementations with learned counterparts.
result Learned data structures can significantly speed up search procedures.
New interior-point method tackles Wasserstein barycenter problem efficiently.
problem Computing Wasserstein barycenter for large support measures.
method Adapted interior-point method exploiting problem's matrix structure.
result Achieves a well-balanced tradeoff between accuracy and speed.
We propose a generic Markov Chain Monte Carlo (MCMC) algorithm to speed up computations for datasets with many observations. A key feature of our approach is the use of the highly efficient difference estimator from the survey sampling literature to estimate the log-likelihood accurately using only a small fraction of …
Closed-form formulas for path-independent options in a specific Lévy model.
problem Valuation of path-independent options in the exponential NIG model.
method Closed-form pricing formulas derived using a factorized representation in Mellin space and complex analysis.
result Valid closed-form formulas with quickly convergent series for various options.
A new screening rule 'dynamic Sasvi' improves sparse optimization speed.
problem Sparse optimization problem identification.
method Flexible framework based on Fenchel-Rockafellar duality for norm-regularized least squares.
result Dynamic Sasvi can eliminate more features and increase solver speed.
New method speeds up Gibbs sampling for large graphs.
problem Efficiently sampling from large graphical models.
method Poisson-minibatching Gibbs sampling.
result Theoretical convergence rate guarantees for Poisson-minibatching Gibbs.
liquidSVM is a package written in C++ that provides SVM-type solvers for various classification and regression tasks. Because of a fully integrated hyper-parameter selection, very carefully implemented solvers, multi-threading and GPU support, and several built-in data decomposition strategies it provides unprecedented…
Adaptive optimal control of nonlinear dynamic systems with deterministic and known dynamics under a known undiscounted infinite-horizon cost function is investigated. Policy iteration scheme initiated using a stabilizing initial control is analyzed in solving the problem. The convergence of the iterations and the optim…
ADVI speeds up Bayesian inference for bridge regression models.
problem Slow MCMC for large datasets in bridge regression.
method Automatic Differentiation Variational Inference (ADVI) for Bayesian inference.
result ADVI implementation speeds up inference for large datasets.
A new method using normalizing flows speeds up Bayesian model comparison.
problem Computational challenges in calculating Bayesian evidence for complex models.
method Savage-Dickey density ratio with normalizing flows.
result The method scales to high-dimensional settings and provides consistent Bayes factors.
New simulation approaches to evaluating path-dependent options without matrix inversion issues nor Euler bias are evaluated. They employ three main contributions: Stochastic approximation replaces regression in the LSM algorithm; Explicit weak solutions to stochastic differential equations are developed and applied to …
Using a simple and well-motivated modification of the stress-energy tensor for a viscous fluid proposed by Lichnerowicz, we prove that Einstein's equations coupled to a relativistic version of the Navier-Stokes equations are well-posed in a suitable Gevrey class if the fluid is incompressible and irrotational. These la…
Paper speeds up topological signal identification and cycle matching.
problem Efficiently identifying and matching topological signals across datasets.
method Cohomological approach to persistent homology computation.
result Significantly faster performance on large-scale datasets.
Bayesian LOO-CV method speeds up model evaluation for big data.
problem Inefficient LOO-CV for large datasets.
method Combining approximate inference and PPS sampling.
result Good properties for large data demonstrated.
CodedFedL speeds up federated learning in MEC networks by 15x.
problem Slow convergence in federated learning due to heterogeneity and stochastic fluctuations.
method Injects structured coding redundancy into federated learning to mitigate stragglers and speed up training.
result CodedFedL speeds up the training procedure by up to 15x compared to benchmark schemes.
Motivated by recent advance of machine learning using Deep Reinforcement Learning this paper proposes a modified architecture that produces more robust agents and speeds up the training process. Our architecture is based on Asynchronous Advantage Actor-Critic (A3C) algorithm where the total input dimensionality is halv…
This paper compares TFC and LS-SVM for solving DEs, showing TFC is faster and more accurate.
problem Solving differential equations efficiently and accurately.
method Theory of Functional Connections (TFC) integrated with LS-SVM.
result TFC is faster and more accurate than LS-SVM for solving DEs.
The paper compares three option pricing models with varying volatility dynamics.
problem Comparing the accuracy and efficiency of different option pricing models with changing volatility.
method Used stochastic volatility models including Heston and MSV, and compared them with existing models on 15 index option datasets.
result Stochastic volatility models achieve comparable accuracy to existing models and are faster to calibrate.
Deep neural networks provide meaningful uncertainty estimates for large-scale simulations.
problem Uncertainty estimates for deep neural network predictions from large-scale simulations.
method General variational inference approach to calibrate Bayesian uncertainties.
result Calibrated Bayesian uncertainties preserved physics-correlations in predicted quantities.
AI applications pose increasing demands on performance, so it is not surprising that the era of client-side distributed software is becoming important. On top of many AI applications already using mobile hardware, and even browsers for computationally demanding AI applications, we are already witnessing the emergence o…
Model predicts traffic incident duration and identifies key features.
problem Predict traffic incident duration and identify critical features.
method Multi-task learning framework with sparsity optimization and ADMM algorithm.
result Model predicts incident duration and identifies key features effectively.
Paper presents novel online MTL methods using WRLS and OSLSSVR.
problem Online Multi-Task Learning (MTL) Regression Problems
method Develops recursive versions of WRLS and OSLSSVR for MTL.
result Achieves exact and approximate recursions with quadratic cost.
A new federated learning method speeds up training by selecting faster nodes first.
problem System heterogeneity and stragglers slow down federated learning.
method Adaptive selection of nodes based on data statistical characteristics.
result Significant speedup in wall-clock time compared to standard federated learning.
New slicing methods speed up Gaussian mixture Wasserstein distance computations.
problem High computational cost of the mixture Wasserstein distance.
method Slicing-based approximations to reduce computational complexity.
result Significant reduction in computational complexity while preserving key properties.
Develops a fast, accurate method for comparing networks.
problem Comparing networks with repeated observations and varying sizes/sparsity.
method A novel two-sample hypothesis testing method with theoretical guarantees.
result Outperforms existing tools in speed and accuracy, power-optimal.
coverforest speeds up conformal predictions for random forests.
problem Efficient uncertainty quantification for random forest predictions.
method Optimized Python package leveraging random forest's out-of-bag scores for cross-conformal predictions.
result coverforest achieves desired coverage with faster training and prediction times.
New NAM model improves image processing speed and accuracy.
problem Time-consuming pixel-by-pixel analysis of large images.
method Integrates Neuronal Attention model (NAM) to focus on small regions.
result Efficiently processes large images with improved speed and accuracy.