Invited Speakers

Surprise Talk

• Click here to get information about Surprise Talk

Track A (Algorithmic Game Theory)

• Dominantly Truthful Multi-task Peer Prediction with a Constant Number of Tasks----Yuqing Kong (Peking University)

• Data-driven Auctions, Prophet Inequality, and Pandora's Problem----Zhiyi Huang (Hong Kong University)

• Fair Division of Mixed Divisible and Indivisible Goods----Xiaohui Bei (Nanyang Technological University)

• Truthful Mechanisms for Location Games of Dual-Role Facilities----Xujin Chen (Chinese Academy of Sciences)

• Envy-freeness up to Any Item with High Nash Welfare----Nick Gravin (SHUFE)

Track B (Blockchain)

• Correctness Conditions for Cross-Chain Deals----Maurice Herlihy (Brown University)

• Formal Design, Implementation and Verification of Blockchain Languages---Grigore Rosu (UIUC)

• Can a Blockchain Keep a Secret----Shai Halevi (Algorand Foundation)

• Direct Evidence of Bitcoin Wash Trading----Jiasun Li (George Mason University)

• A Mechanism Designer's View of Cryptocurrencies----Matt Weinberg (Princeton University)

• An Overview of Recursive Proofs----Alessandro Chiesa (University of California, Berkeley)

• Security Analysis Techniques For Blockchain Smart Contracts----Zhong Chen (Peking University)

• NC-Max: Breaking the Throughput Limit of Nakamoto Consensus----Ren Zhang (Cryptape Co., Ltd.)

• 分布式密钥技术在区块链中的基础性作用----Chengshi Gao (CSIAM Activity Group on Blockchain)

• 基于区块链的社区医疗管控系统----Wei Ou (CSIAM Activity Group on Blockchain)

Track C (Multi-agent Reinforcement Learning)

• Model-based Multi-Agent Reinforcement Learning----Weinan Zhang (Shanghai Jiao Tong University)

• Learning Multi-Agent Cooperation----Zongqing Lu (Peking University)

• An Overview of Game-Based AI Competitions----From a Perspective of AI Evaluation----Wenxin Li (Peking University)

• Online Search and Pursuit-Evasion in Robotics----Guochuan Zhang (Zhejiang University)

• Solution Concepts in Multi-agent Reinforcement Learning----Haifeng Zhang (Chinese Academy of Sciences)

Track D (Learning Theory)

• Provable Representation Learning in Deep Learning----Jason Lee (Princeton University)

• Guarantees for Tuning the Step Size Using a Learning-to-Learn Approach----Rong Ge (Duke University)

• On Generalization and Implicit Bias of Gradient Methods in Deep Learning----Jian Li (Tsinghua University)

• Domain Adaptation with Theoretical Guarantees ----Tengyu Ma (Stanford University)

• Deep Learning for Algorithm Design ----Le Song (Georgia Institute of Technology)

• Understanding Deep "Alchemy" ----Zhanxing Zhu (Peking University)

Track E (Quantum Computing)

• Error Mitigated Quantum Simulation with Near-term Quantum Hardware----Xiao Yuan (Peking University)

• Unpredictable Functions and Quantum-secure Authentication ----Fang Song (Portland State University)

• Nonlocal Games With Noisy Maximally Entangled States are Decidable ----Penghui Yao (Nanjing University)

• Utility Optimization in a Quantum Key Distribution Network ----Xiongfeng Ma (Tsinghua University)

• Spooky Complexity at a Distance ----Zhengfeng Ji (UTS)

• Quantum Algorithms for Convex and Nonconvex Optimization ----Tongyang Li (MIT)

Track F (Machine Learning and Formal Method)

• Safety Certification of Deep Learning----Xiaowei Huang (University of Liverpool)

• Spectral Analysis of Convolutional Neural Networks----Xinping Yi (University of Liverpool)

• Neural Networks: Fairness and Interpretability----Jun Sun (Singapore Management University)

• PAC Model Checking of Block-Box Continuous-Time Dynamical Systems----Bai Xue (Chinese Academy of Sciences)

Track G (Algorithm and Complexity)

• Defending with Shared Resources on a Network----Minming Li (City University of Hong Kong)

Undergraduate Research Forum

• Improved Bounds for the Sunflower Lemma----Kewen Wu (Peking University)

• Sharp Threshold Results for Computational Complexity----Ce Jin (Tsinghua University)

• CycLedger: A Scalable and Secure Parallel Protocol for Distributed Ledger via Sharding----Zhaohua Chen (Peking University)

• Stability in Committee Selection----Zhihao Jiang (Tsinghua University)

• Private Data Manipulation in Sponsored Search Auctions----Tao Lin (Peking University)

• Towards Understanding Optimization of Deep Learning----Tianle Cai (Peking University)

• Recent Development for the Incentive Ratio in BitTorrent Resource Sharing Networks----Yuhao Li (Peking University)

• Attack Discovery on Blockchain Incentive Mechanisms with Reinforcement Learning----Mingxun Zhou (Peking University)

• Towards Large Scale Multi-agent Reinforcement Learning----Zihan Zhou (University of Toronto)

• Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol----Wei Zi (University of Chinese Academy of Sciences)

Female Forum

• Optimization of Scoring Rules----Yifan Wu (Peking University)

• Optimize the Size and Depth of CNOT Circuits----Bujiao Wu (Chinese Academy of Sciences)

• A 1/2-approximation Algorithm for Maximizing a Non-monotone Weak-submodular Function on a Bounded Integer Lattice----Suning Gong (Ocean University of China)

• Quantum Composite Control for Nonorthogonal States against Decoherence----Ya Cao (Beijing University of Posts and Telecommunications)

• Qizhi Fang (Ocean University of China)

• Xujin Chen (Chinese Academy of Science)

• Qi Qi (Hong Kong University of Science and Technology)

• Zhao Zhang (Zhejiang Normal University)

• Yijia Chen (Fudan University)

• Yukun Cheng (USTS)

Young Phd Forum

• Fair Resource Sharing and Dorm Assignment----Bo Li (The Hong Kong Polytechnic University)

• Rapid Mixing from Spectral Independence beyond the Boolean Domain----Chihao Zhang (Shanghai Jiao Tong University)

• Lovasz Local Lemma: Variable and Quantum----Kun He (Shenzhen University)

• Reinforcement Learning with Function Approximation: Provably Efficient Algorithms and Hardness Results----Ruosong Wang (CMU)

• Coreset Construction for Clustering----Lingxiao Huang (Yale)

• Incentive Analysis on Peer-to-Peer Resource Sharing Networks----Xiang Yan (Shanghai Jiao Tong University)

• Fast Sampling and Counting K-SAT Solutions in the Local Lemma Regime----Weiming Feng (Nanjing University)

• Why Are Convolutional Nets More Sample-Efficient than Fully-Connected Nets?----Zhiyuan Li (Princeton)

• Lower Bound for Succinct Range Minimum Query----Mingmou Liu (Nanjing University)