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.

Siqi Liang 0005

dblp:214/9483-5 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2022
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 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
2 papers
Probabilistic and Bayesian machine learning · 38% Representation and self-supervised learning · 38% Deep learning architectures and training · 19%
Theoretical computer science
1 paper
Algorithms and data structures · 50% Mathematical optimization · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods
interacting particle systems
0.612022
Interacting Contour Stochastic Gradient Langevin Dynamics · ICLR 2022
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction › sufficient dimension reduction
nonlinear sufficient dimension reduction
0.612022
Nonlinear Sufficient Dimension Reduction with a Stochastic Neural Network · NeurIPS 2022
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods › markov chain monte carlo › langevin dynamics
stochastic gradient langevin dynamics
0.612022
Interacting Contour Stochastic Gradient Langevin Dynamics · ICLR 2022
Machine learning › Deep learning architectures and training
stochastic neural network
0.612022
Nonlinear Sufficient Dimension Reduction with a Stochastic Neural Network · NeurIPS 2022
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
sufficient dimension reduction
0.612022
Nonlinear Sufficient Dimension Reduction with a Stochastic Neural Network · NeurIPS 2022
Mathematical optimization
langevin dynamics
0.612022
Interacting Contour Stochastic Gradient Langevin Dynamics · ICLR 2022
Algorithms and data structures › randomized algorithms
sampling
0.612022
Interacting Contour Stochastic Gradient Langevin Dynamics · ICLR 2022
Machine learning › Optimization for machine learning
convergence analysis
0.212022
Nonlinear Sufficient Dimension Reduction with a Stochastic Neural Network · NeurIPS 2022

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

stochastic gradient langevin dynamics · 1.1interacting particles · 1.1stochastic neural network · 0.6stochastic gradient · 0.6markov chain monte carlo · 0.6
YearPublicationVenuePosition
2022 Interacting Contour Stochastic Gradient Langevin Dynamics
Wei Deng 0002, Siqi Liang 0005, Botao Hao, Guang Lin 0001, Faming Liang
ICLR2
2022 Nonlinear Sufficient Dimension Reduction with a Stochastic Neural Network
abstract
Sufficient dimension reduction is a powerful tool to extract core information hidden in the high-dimensional data and has potentially many important applications in machine learning tasks. However, the existing nonlinear sufficient dimension reduction methods often lack the scalability necessary for dealing with large-scale data. We propose a new type of stochastic neural network under a rigorous probabilistic framework and show that it can be used for sufficient dimension reduction for large-scale data. The proposed stochastic neural network is trained using an adaptive stochastic gradient Markov chain Monte Carlo algorithm, whose convergence is rigorously studied in the paper as well. Through extensive experiments on real-world classification and regression problems, we show that the proposed method compares favorably with the existing state-of-the-art sufficient dimension reduction methods and is computationally more efficient for large-scale data.
Siqi Liang 0005, Yan Sun 0011, Faming Liang
NeurIPS1