Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

2955908851,180 · Jun 202019922001200920172026
48 results for Halpern method

Improved stochastic Halpern iteration for fixed-point approximation in normed spaces.

problem Approximating fixed-points of nonexpansive and contractive operators in normed finite-dimensional spaces.
method Stochastic Halpern iteration with minibatch, analyzing oracle complexity.
result Improved oracle complexity for nonexpansive operators, with a lower bound of Ω(ε3)Ω(\varepsilon^{-3}).

New algorithms solve monotone inclusions and convex-concave minimax problems.

problem Solving maximally monotone equations and inclusions.
method Developed new accelerated algorithms based on Halpern-type fixed-point iteration and Popov's past extra-gradient method.
result Achieved O(1/k)\mathcal{O}(1/k) convergence rates for various problems.

The paper relaxes assumptions for analyzing stochastic optimization algorithms.

problem Analyzing the convergence of stochastic gradient algorithms under weaker variance assumptions.
method Building on and extending a connection to the Halpern iteration, the paper analyzes algorithms for convex nonsmooth optimization and min-max problems.
result Rates for optimality measures are obtained without requiring boundedness of the feasible set for problems beyond simple constrained optimization.

Optimizes solving complex min-max problems with stochastic and nonconvex elements.

problem Min-max problems with stochastic and nonconvex elements.
method Combines conic nonexpansiveness, refined inexact Halpern iteration, and multilevel Monte Carlo estimator.
result Optimal or best-known complexity guarantees for $ρ< rac{1}{L}$, improving previous results.

VR-GHAL method solves stochastic fixed-point equations with high probability.

problem Solving stochastic fixed-point equations in normed spaces with nonexpansive or contractive operators.
method VR-GHAL, a variance-reduced gradual Halpern method for quadratically smoothable Banach spaces, using clipped stochastic differences.
result The method achieves a high-probability residual bound, reducing the residual nearly geometrically across epochs.

Survey on extragradient methods for solving nonlinear equations and inclusions.

problem Approximating solutions of nonlinear equations and inclusions.
method Unified convergence analysis of extragradient and its variants.
result Sublinear convergence rates for different classes of algorithms.

Two accelerated extragradient methods converge at O(1/k)O(1/k) rate for co-hypomonotone inclusions.

problem Solving co-hypomonotone inclusions with sum of Lipschitz and multivalued operators.
method Developed two Nesterov's accelerated extragradient methods for co-hypomonotone inclusions.
result Achieve O(1/k)\mathcal{O}(1/k) last-iterate convergence rates on the residual norm.

New model-free RL algorithm tackles robust average-reward problems with finite sample complexity analysis.

problem Long-term decision-making in environments with varying dynamics.
method Proposes Robust Halpern Iteration (RHI) algorithm based on a black-box sampling oracle and multi-level Monte-Carlo estimator.
result Achieves ε-optimal robust policy with sample complexity of O(1/ε^(2+o(1))) under generative model setting.

Predicts the number of polynomial additions in Buchberger's algorithm using machine learning.

problem Predict the number of polynomial additions in Buchberger's algorithm.
method Multiple linear regression and recursive neural network models trained on ideal generator statistics.
result Machine learning can predict the number of polynomial additions in Buchberger's algorithm.

This paper characterizes projective models in statistical relational learning.

problem Projectivity in statistical relational models is beneficial for inference and learning.
method Representation theorems for infinite exchangeable arrays to characterize projective models.
result A class of directed graphical latent variable models correspond to projective relational models.

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…

2016-02-08abs ↗pdf ↗

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.

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, …

2015-10-15abs ↗pdf ↗

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.

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.

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.

Spectral methods of moments provide a powerful tool for learning the parameters of latent variable models. Despite their theoretical appeal, the applicability of these methods to real data is still limited due to a lack of robustness to model misspecification. In this paper we present a hierarchical approach to methods…

2018-10-17abs ↗pdf ↗

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…

2015-06-09abs ↗pdf ↗

We discuss the relevance of the recent Machine Learning (ML) literature for economics and econometrics. First we discuss the differences in goals, methods and settings between the ML literature and the traditional econometrics and statistics literatures. Then we discuss some specific methods from the machine learning l…

2019-03-24abs ↗pdf ↗

We generalize Newton-type methods for minimizing smooth functions to handle a sum of two convex functions: a smooth function and a nonsmooth function with a simple proximal mapping. We show that the resulting proximal Newton-type methods inherit the desirable convergence behavior of Newton-type methods for minimizing s…

2012-06-07abs ↗pdf ↗

We discuss various analytic and numerical methods that have been used to get option prices within a framework of the VG model. We show that some popular methods, for instance, Carr-Madan's FFT method could blow up for certain values of the model parameters even for an European vanilla option. Alternative methods - one …

2005-03-16abs ↗pdf ↗

Statistical estimates can often be improved by fusion of data from several different sources. One example is so-called ensemble methods which have been successfully applied in areas such as machine learning for classification and clustering. In this paper, we present an ensemble method to improve community detection by…

2013-09-01abs ↗pdf ↗

We present the Variational Adaptive Newton (VAN) method which is a black-box optimization method especially suitable for explorative-learning tasks such as active learning and reinforcement learning. Similar to Bayesian methods, VAN estimates a distribution that can be used for exploration, but requires computations th…

2017-11-15abs ↗pdf ↗

We have developed a novel prediction method based on string invariants. The method does not require learning but a small set of parameters must be set to achieve optimal performance. We have implemented an evolutionary algorithm for the parametric optimization. We have tested the performance of the method on artificial…

2016-06-20abs ↗pdf ↗