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

Zhenjie Ren

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

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

Artificial intelligence and machine learning · 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
Learning theory · 50% Deep learning architectures and training · 50%
Theoretical computer science
1 paper
Mathematical optimization · 77% Algorithmic game theory and mechanism design · 23%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory › statistical learning theory › statistical physics of learning
mean-field analysis
0.712023
Entropic Fictitious Play for Mean Field Optimization Problem · J. Mach. Learn. Res. 2023
Machine learning › Deep learning architectures and training › feedforward neural network
two-layer neural network
0.712023
Entropic Fictitious Play for Mean Field Optimization Problem · J. Mach. Learn. Res. 2023
Mathematical optimization › stochastic optimization
mean-field optimization
0.712023
Entropic Fictitious Play for Mean Field Optimization Problem · J. Mach. Learn. Res. 2023
Algorithmic game theory and mechanism design › learning in games
fictitious play
0.212023
Entropic Fictitious Play for Mean Field Optimization Problem · J. Mach. Learn. Res. 2023

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

fictitious play · 1.3entropic regularization · 1.3
YearPublicationVenuePosition
2023 Entropic Fictitious Play for Mean Field Optimization Problem
abstract
We study two-layer neural networks in the mean field limit, where the number of neurons tends to infinity. In this regime, the optimization over the neuron parameters becomes the optimization over the probability measures, and by adding an entropic regularizer, the minimizer of the problem is identified as a fixed point. We propose a novel training algorithm named entropic fictitious play, inspired by the classical fictitious play in game theory for learning Nash equilibriums, to recover this fixed point, and the algorithm exhibits a two-loop iteration structure. Exponential convergence is proved in this paper and we also verify our theoretical results by simple numerical examples.
Zhenjie Ren, Songbo Wang
J. Mach. Learn. Res.2