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.

Jiayuan Wu

dblp:189/5953 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
5since 2021 · last 2025
—ORCID · conflict

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

Artificial intelligence and machine learning · 4 · 1 first-author · 4 since 2021Computer networks · 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.

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
Mathematical optimization › continuous optimization
composite optimization
0.812024
A projected semismooth Newton method for a class of nonconvex composite programs with strong prox-regularity · J. Mach. Learn. Res. 2024
Mathematical optimization
nonconvex optimization
0.812024
A projected semismooth Newton method for a class of nonconvex composite programs with strong prox-regularity · J. Mach. Learn. Res. 2024
Mathematical optimization › continuous optimization
nonsmooth optimization
0.812024
A projected semismooth Newton method for a class of nonconvex composite programs with strong prox-regularity · J. Mach. Learn. Res. 2024
Mathematical optimization
riemannian optimization
0.812024
A projected semismooth Newton method for a class of nonconvex composite programs with strong prox-regularity · J. Mach. Learn. Res. 2024
Mathematical optimization › numerical computation › numerical optimization › second-order methods › newton's method
semismooth newton method
0.812024
A projected semismooth Newton method for a class of nonconvex composite programs with strong prox-regularity · J. Mach. Learn. Res. 2024

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

semismooth newton method · 0.8proximal gradient method · 0.8projected newton method · 0.8
YearPublicationVenuePosition
2025 Multi-hop Knowledge-Enhanced Query Reasoning for Multi-modal Medical Video QA
Yangchengyu Zhou, Jiayuan Wu, Yunze Li
NLPCC (4)2
2025 Label-only model inversion attacks: Adaptive boundary exclusion for limited queries
Jiayuan Wu, Chang Wan, Zhonglong Zheng
Neurocomputing1
2024 Spectral Efficient Hybrid Beamforming Design for Full-Duplex Cell-Free Massive MIMO System
abstract
In this paper, we investigate a full-duplex (FD) cell-free massive multiple-input multiple-output (mMIMO) system. To cope with the cross-link interference, especially the interaccess point (inter-AP) interference, we formulate a sum spectral efficiency maximization problem by jointly optimizing the digital and analog beamforming at FD AP and digital precoder at the uplink user equipment. To solve it, we present a fully digital design first by utilizing successive convex approximations and majorization-minimization to obtain a closed-form solution in each iteration. After that, we exploit the Riemannian manifold to get a hybrid design, which is shown to approximate the fully digital one well. Simulation results show that the proposed design enhances the sum spectral efficiency as well as uplink performance effectively when compared to other benchmarks.
Yingyang Chen, Jiayuan Wu, Jing Li 0006, Xuan Chen 0001, Qiang Li 0020, Li Wang 0039
GLOBECOM2
2024 A projected semismooth Newton method for a class of nonconvex composite programs with strong prox-regularity
abstract
This paper aims to develop a Newton-type method to solve a class of nonconvex composite programs. In particular, the nonsmooth part is possibly nonconvex. To tackle the nonconvexity, we develop a notion of strong prox-regularity which is related to the singleton property and Lipschitz continuity of the associated proximal operator, and we verify it in various classes of functions, including weakly convex functions, indicator functions of proximally smooth sets, and two specific sphere-related nonconvex nonsmooth functions. In this case, the problem class we are concerned with covers smooth optimization problems on manifold and certain composite optimization problems on manifold. For the latter, the proposed algorithm is the first second-order type method. Combining with the semismoothness of the proximal operator, we design a projected semismooth Newton method to find a root of the natural residual induced by the proximal gradient method. Due to the possible nonconvexity of the feasible domain, an extra projection is added to the usual semismooth Newton step and new criteria are proposed for the switching between the projected semismooth Newton step and the proximal step. The global convergence is then established under the strong prox-regularity. Based on the BD regularity condition, we establish local superlinear convergence. Numerical experiments demonstrate the effectiveness of our proposed method compared with state-of-the-art ones.
Kangkang Deng, Jiayuan Wu, Quanzheng Li
J. Mach. Learn. Res.3
2021 A queuing network simulation optimization method for coordination control of passenger flow in urban rail transit stations
Xinpei Xu, Jiayuan Wu
Neural Comput. Appl.4