Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lingwei Peng

dblp:299/5371 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 50% Optimization for machine learning · 50%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference › variational inference
particle-based variational inference
0.512021
SHPOS: A Theoretical Guaranteed Accelerated Particle Optimization Sampling Method · IJCAI 2021
Machine learning › Optimization for machine learning
stochastic optimization
0.512021
SHPOS: A Theoretical Guaranteed Accelerated Particle Optimization Sampling Method · IJCAI 2021
Machine learning › Optimization for machine learning
variance reduction
0.512021
SHPOS: A Theoretical Guaranteed Accelerated Particle Optimization Sampling Method · IJCAI 2021
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
variational inference
0.512021
SHPOS: A Theoretical Guaranteed Accelerated Particle Optimization Sampling Method · IJCAI 2021
Mathematical optimization › convergence analysis
non-asymptotic analysis
0.112021
SHPOS: A Theoretical Guaranteed Accelerated Particle Optimization Sampling Method · IJCAI 2021

Methods — techniques the papers use, named apart from their topics

stochastic hamiltonian dynamics · 1.0langevin dynamics · 1.0variance-reduced stochastic gradient · 0.5variance reduced stochastic gradient · 0.5
YearPublicationVenuePosition
2021 SHPOS: A Theoretical Guaranteed Accelerated Particle Optimization Sampling Method
abstract
Recently, the Stochastic Particle Optimization Sampling (SPOS) method is proposed to solve the particle-collapsing pitfall of deterministic Particle Variational Inference methods by ultilizing the stochastic Overdamped Langevin dynamics to enhance exploration. In this paper, we propose an accelerated particle optimization sampling method called Stochastic Hamiltonian Particle Optimization Sampling (SHPOS). Compared to the first-order dynamics used in SPOS, SHPOS adopts an augmented second-order dynamics, which involves an extra momentum term to achieve acceleration. We establish a non-asymptotic convergence analysis for SHPOS, and show that it enjoys a faster convergence rate than SPOS. Besides, we also propose a variance-reduced stochastic gradient variant of SHPOS for tasks with large-scale datasets and complex models. Experiments on both synthetic and real data validate our theory and demonstrate the superiority of SHPOS over the state-of-the-art.
Chao Zhang 0029, Hui Qian 0001, Xin Du 0005, Lingwei Peng
IJCAI5