New method improves continual learning by generating samples and labels together.
problem Improving continual learning in complex classification tasks.
method Conditional replay generates samples and labels together, reducing label inference error.
result Conditional replay outperforms marginal replay and EWC on benchmarks.
The study explores when parametric models enhance reinforcement learning, validating a hypothesis on Atari games.
problem When and how to use parametric models in reinforcement learning.
method Comparison of parametric models and experience replay, validating a hypothesis on Atari games.
result Replay-based algorithms can be competitive or superior to model-based algorithms under suitable conditions.
Proposes a method to use λ-returns in replay-based reinforcement learning.
problem Difficulty in implementing λ-returns in off-policy methods with experience replay. method Promotes short sequences into a cache, precomputes λ-returns, and uses TD errors for dynamic λ-values. result Enhances DQN performance on Atari games, even under partial observability.
CLOPS improves deep learning for continuous physiological data.
problem Deep learning struggles with streaming, multi-sensor clinical data.
method CLOPS is a replay-based continual learning strategy.
result CLOPS outperforms state-of-the-art methods in continual learning scenarios.
Paper proposes a new method to select memory data for online class-incremental learning.
problem Selecting which buffered images to replay for online class-incremental learning.
method Adversarial Shapley value scoring method to preserve latent decision boundaries.
result Proposed ASER method provides competitive or improved performance compared to state-of-the-art methods.
D-CBRS manages memory for continual learning by accounting for intra-class diversity.
problem Forgetting in continual learning, especially with class-imbalanced data.
method D-CBRS introduces a novel approach to store instances in memory, considering intra-class diversity.
result D-CBRS outperforms existing methods on data sets with intra-class diversity.
Develops a framework for continual learning in anomaly detection.
problem Deterioration of monitoring performance due to new defect categories.
method Pseudo replay-based class incremental learning with oversampling.
result Enhanced monitoring performance and flexibility in model architecture.
Combines experience replay techniques to improve reinforcement learning.
problem Improving reinforcement learning algorithms.
method Combines CER, PER, and HER with DDPG and DQN.
result Effective combinations of these techniques in various environments.
The paper improves reinforcement learning stability and efficiency with a new theoretical framework.
problem Stability and efficiency in reinforcement learning, especially in data-scarce scenarios.
method Theoretical framework using resampled U- and V-statistics to model experience replay, applied to policy evaluation and kernel ridge regression. result Significant improvements in stability and efficiency, particularly in data-scarce scenarios.
La-MAML improves fast online continual learning with a look-ahead approach.
problem Fast online continual learning with limited model capacity.
method Optimisation-based meta-learning with look-ahead and episodic memory.
result Superior performance on visual classification benchmarks.
CAM-GAN improves GANs for continual learning with efficient feature map transformations.
problem Efficient continual learning for GANs with reduced parameter growth.
method Designing and leveraging parameter-efficient feature map transformations, including global and task-specific parameters, residual bias, and Fisher information matrix.
result Significantly improved model performance and high-quality samples with fewer parameters.
This research tackles imbalanced continual learning with a new sampling strategy.
problem Long-tailed distribution in multi-label datasets.
method Partitioning Reservoir Sampling (PRS) for balanced knowledge of head and tail classes.
result The proposed PRS strategy maintains a balanced knowledge of both head and tail classes.
ER-GNN uses experience replay to prevent GNNs from forgetting previous tasks.
problem Catastrophic forgetting in GNNs when learning multiple tasks sequentially.
method Experience Replay framework to store and replay knowledge from previous tasks.
result ER-GNN effectively mitigates catastrophic forgetting in GNNs.
SynthER uses generative models to augment limited RL experience.
problem Limited data for reinforcement learning agents.
method SynthER leverages diffusion models to generate synthetic experience data.
result SynthER significantly improves sample efficiency and training of RL agents.
Neural network tackles continual learning with neuromodulation and local error signals.
problem Catastrophic forgetting in continuous learning.
method Biologically-inspired neural architecture with local learning and neuromodulation, combined with transfer metalearning.
result Superior performance in continual learning tasks compared to other approaches.
Improved iterative methods for risk parity portfolio weights.
problem Solving for portfolio weights in risk parity allocation.
method Enhanced CCD and Newton methods, including a rescaling step and improved initial guess.
result Improved CCD method is the best, three times faster with 40% fewer iterations.
We describe a novel optimization method for finite sums (such as empirical risk minimization problems) building on the recently introduced SAGA method. Our method achieves an accelerated convergence rate on strongly convex smooth problems. Our method has only one parameter (a step size), and is radically simpler than o…
A new method combines Laplace and Variational Bayes for scalable inference.
problem Complex models and large datasets make exact inference infeasible.
method Low-Rank Variational Bayes Correction (VBC) using Laplace method and Variational Bayes correction in a lower dimension.
result The method ensures scalability in both model complexity and data size.
Unified framework for model explanation methods based on feature removal.
problem Unclear relationships and preferences among various model explanation methods.
method Characterizes removal-based explanations along three dimensions.
result Unified 26 existing methods, including widely used approaches.
This work reviews and evaluates methods for predicting prediction intervals in regression problems.
problem Calibration of prediction intervals in regression problems.
method Four classes of methods: Bayesian, ensemble, direct interval estimation, and conformal prediction.
result Conformal prediction can be used as a general calibration procedure.
Derives kernel PCA with Nyström method for scalability.
problem Scalability of kernel PCA.
method Nyström method for kernel PCA.
result Provides scalable alternative to full kernel PCA.
In this paper, the author considers the numerical computation of CVA for large systems by Mote Carlo methods. He introduces two types of stochastic mesh methods for the computations of CVA. In the first method, stochastic mesh method is used to obtain the future value of the derivative contracts. In the second method, …
Develops a fast method for pricing American options under variance gamma model.
problem Inefficient methods for pricing American options under variance gamma model.
method Inspired by quadratic approximation method, uses machine learning on pre-calculated quantities to reduce error.
result Proposed method is efficient and accurate for practical use.
Two RBF methods solve complex financial derivatives pricing problems.
problem Pricing derivatives in models with multiple stochastic factors.
method Radial Basis Function Partition of Unity and Radial Basis Function generated Finite Differences methods.
result Both methods achieve high accuracy and are efficient for solving multi-dimensional PDEs.
New method combines spectral and sparse methods for Gaussian processes.
problem Efficiently fitting Gaussian processes to large datasets.
method Orthogonally decoupled variational Fourier features.
result Competitive performance on synthetic and real-world data.
Simple stochastic Newton and cubic Newton methods with fast convergence.
problem Minimizing large numbers of smooth and strongly convex functions.
method Stochastic Newton and cubic Newton methods with simple local linear-quadratic rates.
result Local linear-quadratic convergence results with fast adaptation to problem's curvature.
Improved spectral methods of moments for robust latent variable model learning.
problem Limited robustness of spectral methods of moments to model misspecification.
method Hierarchical approach using approximate joint diagonalization instead of tensor decomposition.
result Our method outperforms previous tensor decomposition methods in speed and model quality.
VAN method optimizes learning tasks with unified methods.
problem Optimizing learning tasks in active and reinforcement learning.
method Variational Adaptive-Newton method that unifies optimization, inference, and evolution strategies.
result VAN performs well on various learning tasks.
A comprehensive benchmark of 15 scRNA-seq imputation methods across various datasets and analyses.
problem Imputation of single-cell RNA sequencing data to recover latent transcriptional signals.
method Evaluation of 15 imputation methods across 30 datasets and 6 downstream analyses.
result Traditional methods generally outperform DL-based methods in scRNA-seq data analysis.
New methods using natural gradient for structured optimization.
problem Structured optimization problems.
method Structured second-order methods via natural gradient descent.
result Efficiency demonstrated on non-convex and deep learning problems.
Improved A2C method with lower variance.
problem Reducing variance in deep policy gradient methods.
method Using control variate theory, derived a new A2C formulation with lower variance.
result New A2C method has lower variance and improved performance.
Recently, {\it stochastic momentum} methods have been widely adopted in training deep neural networks. However, their convergence analysis is still underexplored at the moment, in particular for non-convex optimization. This paper fills the gap between practice and theory by developing a basic convergence analysis of t…
A new method speeds up deep neural network training.
problem Nonconvex optimization in deep neural networks.
method Scaled conjugate gradient method for nonconvex optimization.
result The method converges faster and achieves lower scores in practical applications.
We propose a new stochastic dual coordinate ascent technique that can be applied to a wide range of regularized learning problems. Our method is based on Alternating Direction Multiplier Method (ADMM) to deal with complex regularization functions such as structured regularizations. Although the original ADMM is a batch…
NCG methods improve shape optimization efficiency.
problem Shape optimization problems
method Nonlinear conjugate gradient methods
result NCG methods are efficient for shape optimization
Proposes UTC method for stock price prediction with uncertainty quantification.
problem Lack of uncertainty estimates in stock prediction methods.
method Combines TC method with probabilistic modeling for point and uncertainty predictions.
result UTC method achieves higher returns and lower risks than baselines.
Various approaches to gene selection for cancer classification based on microarray data can be found in the literature and they may be grouped into two categories: univariate methods and multivariate methods. Univariate methods look at each gene in the data in isolation from others. They measure the contribution of a p…
Geometric methods study 3-manifold splittings.
problem Studying Heegaard splittings of 3-manifolds.
method Geometric approaches.
result Recent advances in geometric methods.
Survey of spectral, probabilistic, and deep metric learning methods.
problem Developing effective distance metrics for various machine learning tasks.
method Divided into spectral, probabilistic, and deep approaches, covering various techniques and their applications.
result Comprehensive overview of metric learning methods, including new developments and applications.
A novel weighted feature selection method using fuzzy sets improves classification accuracy and stability.
problem Improving feature selection accuracy and stability in machine learning models.
method Combination of four feature selection methods using fuzzy sets and bootstrap.
result Our method achieved significantly higher stability than individual methods.
New method improves accuracy in computing implied volatility.
problem Computing implied volatility from the Black-Scholes model.
method Adaptive gradient descent optimizers for numerical computation.
result More accurate results compared to close form approximation and Newton-Raphson method.
The paper examines Wiener process for LID estimation methods.
problem Estimating local intrinsic dimension in high-dimensional datasets.
method Investigates recent LID estimation methods from a Wiener process perspective.
result Explains how methods behave under non-ideal conditions.
Discuss ML methods for economists, highlighting better performance in econometrics.
problem Applying ML methods to econometrics problems.
method Supervised and unsupervised learning methods, matrix completion, causal inference, optimal policy estimation.
result ML methods often outperform traditional econometric methods in specific econometrics problems.
New method detects business-relevant outliers in e-commerce conversion rates.
problem Identifying outliers in e-commerce conversion rate data.
method A novel unsupervised fluid IQR method that adjusts sensitivity based on platform activity.
result Fluid IQR method outperforms existing methods in business-relevance and robustness.
Saliency methods often misattribute predictions due to input transformations.
problem Saliency methods lack reliability when explanations are sensitive to non-contributing factors.
method Used a simple pre-processing step to demonstrate that transformations with no effect on the model can cause misleading attributions.
result Saliency methods that do not satisfy input invariance (mirror model sensitivity to input transformations) result in misleading attributions.
Medical image reconstruction advances from sparse models to machine learning.
problem Improving image quality and reducing noise in medical imaging.
method Iterative reconstruction, modified data acquisition methods, and machine learning models.
result Machine learning methods show promise in improving image quality.
We propose an optimization method for minimizing the finite sums of smooth convex functions. Our method incorporates an accelerated gradient descent (AGD) and a stochastic variance reduction gradient (SVRG) in a mini-batch setting. Unlike SVRG, our method can be directly applied to non-strongly and strongly convex prob…
R package for counterfactual explanation methods.
problem Lack of unified interfaces for counterfactual explanation methods.
method Developed a modular R6-based interface for three existing counterfactual methods and proposed extensions.
result Comparison of implemented methods' quality and runtime behavior.