◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Puning Zhao

Sun Yat-sen University

10 papers hereh-index 9225 citations18 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author8
  • middle author1

Across the 9 of 10 papers where every author was matched, so the position is known.

fields
  • cs.LG4
  • math.ST2
  • stat.ML2
  • cs.CR1
  • cs.IT1
affiliations
  • Sun Yat-sen University
same name
  • Puning Zhao — 20 papers, h 5
  • Puning Zhao — 2 papers, h 3
  • Puning Zhao — 1 paper, h 1

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20182026
most citedMinimax Rate Optimal Adaptive Nearest Neighbor Classification and Regression

8 citations · 18 across the 9 of their papers we have counts for

collaborators
Showing cs.LGShow all

4 papers · 1 filter

cs.LG2023★ 1 cited

A Huber Loss Minimization Approach to Byzantine Robust Federated Learning

Puning Zhao, Fei Yu, Zhiguo Wan

Federated learning systems are susceptible to adversarial attacks. To combat this, we introduce a novel aggregator based on Huber loss minimization, and provide a comprehensive the…

cs.LG2023

Minimax Optimal Q Learning with Nearest Neighbors

Puning Zhao, Lifeng Lai

Analyzing the Markov decision process (MDP) with continuous state spaces is generally challenging. A recent interesting work \cite{shah2018q} solves MDP with bounded continuous sta…

cs.LG2023★ 1 cited

High Dimensional Distributed Gradient Descent with Arbitrary Number of Byzantine Attackers

Wenyu Liu, Tianqiang Huang, Pengfei Zhang +3

Adversarial attacks pose a major challenge to distributed learning systems, prompting the development of numerous robust learning methods. However, most existing approaches suffer…

cs.LG2021

Optimal Stochastic Nonconvex Optimization with Bandit Feedback

Puning Zhao, Lifeng Lai

In this paper, we analyze the continuous armed bandit problems for nonconvex cost functions under certain smoothness and sublevel set assumptions. We first derive an upper bound on…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.