Wojciech Szpankowski
16 papers · 2020–2026 · 8 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+5 more ↓ Show less ↑
π£ Hot Topic Early Bird π Conference Polyglot Β· Silver π Academic Marathon Β· Sprint π Interdisciplinary Bridge Β· Silver πΊοΈ Taxonomy Completionist (31)
π
Grand Slam
π
Keyword Champion
(2)
ποΈ
Keyword Collector
(88)
π
Century Club Β· Bronze
π₯
Unstoppable Β· Bronze
Top co-authors
Research topics
Machine Learning
(16)
Optimization & Theory
(16)
Mathematics & Optimization
(12)
Mathematics
(7)
Optimization
(6)
Core Methods
(5)
Learning Types Β· Machine Learning
(4)
Deep Learning
(2)
Interdisciplinary
(2)
Security & Privacy
(2)
Application Areas
(2)
Science
(2)
Architectures
(1)
Differential Privacy
(1)
Learning Types Β· Deep Learning
(1)
Keywords
online learning
(6)
information theory
(5)
statistical learning
(3)
minimax regret
(3)
vc dimension
(3)
phase transition
(2)
logistic regression
(2)
fourier expansion
(2)
fourier analysis
(1)
quantum computing
(1)
probabilistic modeling
(1)
quantum machine learning
(1)
pac learning
(1)
community detection
(1)
message passing
(1)
minimax optimality
(1)
regret minimization
(1)
online classification
(1)
computational complexity
(1)
feature selection
(1)
Papers
Phase Transition of Regret for Logistic Regression with Large Weights
ALT 2026
No Free Lunch: Fundamental Limits of Learning Non-Hallucinating Generative Models
ICLR 2025
Information-theoretic Limits of Online Classification with Noisy Labels
NeurIPS 2024
Online Distribution Learning with Local Privacy Constraints
AISTATS 2024
Oracle-Efficient Hybrid Online Learning with Unknown Distribution
COLT 2024
Agnostic PAC Learning of k-juntas Using L_2-Polynomial Regression
AISTATS 2023
Learning Functional Distributions with Private Labels
ICML 2023
Learning k-qubit Quantum Operators via Pauli Decomposition
AISTATS 2023
Online Learning in Dynamically Changing Environments
COLT 2023
Data-Derived Weak Universal Consistency
JMLR 2022
Precise Regret Bounds for Log-loss via a Truncated Bayesian Algorithm
NeurIPS 2022
Statistical and computational thresholds for the planted k-densest sub-hypergraph problem
AISTATS 2022
Toward Physically Realizable Quantum Neural Networks
AAAI 2022
Finding Relevant Information via a Discrete Fourier Expansion
ICML 2021
Precise Minimax Regret for Logistic Regression with Categorical Feature Values
ALT 2021
Toward universal testing of dynamic network models
ALT 2020