Li Zhang

Orcid: 0009-0009-4214-2174

Affiliations:
  • Google Inc., Mountain View, CA, USA
  • Microsoft Research Silicon Valley, Mountain View, CA, USA
  • Hewlett Packard Laboratories, Palo Alto, CA, USA
  • Compaq Systems Research Center, Palo Alto, CA, USA
  • Stanford University, Department of Computer Science, Stanford, CA, USA (PhD 2000)


According to our database1, Li Zhang authored at least 88 papers between 1997 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Private Learning with Public Features.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023
NeRF-LiDAR: Generating Realistic LiDAR Point Clouds with Neural Radiance Fields.
CoRR, 2023

Single-view Neural Radiance Fields with Depth Teacher.
CoRR, 2023

Private Matrix Factorization with Public Item Features.
Proceedings of the 17th ACM Conference on Recommender Systems, 2023

Multi-Task Differential Privacy Under Distribution Skew.
Proceedings of the International Conference on Machine Learning, 2023

S-NeRF: Neural Radiance Fields for Street Views.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022
Revisiting the Performance of iALS on Item Recommendation Benchmarks.
Proceedings of the RecSys '22: Sixteenth ACM Conference on Recommender Systems, Seattle, WA, USA, September 18, 2022

2021
Differentially private false discovery rate control.
J. Priv. Confidentiality, 2021

ALX: Large Scale Matrix Factorization on TPUs.
CoRR, 2021

iALS++: Speeding up Matrix Factorization with Subspace Optimization.
CoRR, 2021

Oneshot Differentially Private Top-k Selection.
Proceedings of the 38th International Conference on Machine Learning, 2021

Private Alternating Least Squares: Practical Private Matrix Completion with Tighter Rates.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Superbloom: Bloom filter meets Transformer.
CoRR, 2020

Neural Collaborative Filtering vs. Matrix Factorization Revisited.
Proceedings of the RecSys 2020: Fourteenth ACM Conference on Recommender Systems, 2020

Rankmax: An Adaptive Projection Alternative to the Softmax Function.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Large-Scale Weakly-Supervised Content Embeddings for Music Recommendation and Tagging.
Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

Zero-Shot Heterogeneous Transfer Learning from Recommender Systems to Cold-Start Search Retrieval.
Proceedings of the CIKM '20: The 29th ACM International Conference on Information and Knowledge Management, 2020

2019
Rényi Differential Privacy of the Sampled Gaussian Mechanism.
CoRR, 2019

On the Difficulty of Evaluating Baselines: A Study on Recommender Systems.
CoRR, 2019

Efficient Training on Very Large Corpora via Gramian Estimation.
Proceedings of the 7th International Conference on Learning Representations, 2019

2018
Learning Differentially Private Recurrent Language Models.
Proceedings of the 6th International Conference on Learning Representations, 2018

2017
Learning Differentially Private Language Models Without Losing Accuracy.
CoRR, 2017

On the Protection of Private Information in Machine Learning Systems: Two Recent Approaches.
CoRR, 2017

On the Protection of Private Information in Machine Learning Systems: Two Recent Approches.
Proceedings of the 30th IEEE Computer Security Foundations Symposium, 2017

2016
Well Separated Pair Decomposition for Unit-Disk Graph.
Encyclopedia of Algorithms, 2016

The Geometry of Differential Privacy: The Small Database and Approximate Cases.
SIAM J. Comput., 2016

Deep Learning with Differential Privacy.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
Private False Discovery Rate Control.
CoRR, 2015

Nearly Optimal Private LASSO.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

2014
Private Empirical Risk Minimization Beyond the Worst Case: The Effect of the Constraint Set Geometry.
CoRR, 2014

Analyze gauss: optimal bounds for privacy-preserving principal component analysis.
Proceedings of the Symposium on Theory of Computing, 2014

Learning Sparse Polynomial Functions.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Learning Polynomials with Neural Networks.
Proceedings of the 31th International Conference on Machine Learning, 2014

2013
The geometry of differential privacy: the sparse and approximate cases.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Sybil-proof mechanisms in query incentive networks.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

2012
The Mind Grows Circuits
CoRR, 2012

Understanding cyclic trends in social choices.
Proceedings of the Fifth International Conference on Web Search and Web Data Mining, 2012

Domain bias in web search.
Proceedings of the Fifth International Conference on Web Search and Web Data Mining, 2012

Poster: multi-track map matching.
Proceedings of the 10th International Conference on Mobile Systems, 2012

The minimax risk of truncated series estimators for symmetric convex polytopes.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Multi-track map matching.
Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 2012

2011
Proportional response dynamics in the Fisher market.
Theor. Comput. Sci., 2011

2010
Understanding Fashion Cycles as a Social Choice
CoRR, 2010

StarTrack Next Generation: A Scalable Infrastructure for Track-Based Applications.
Proceedings of the 9th USENIX Symposium on Operating Systems Design and Implementation, 2010

Scalable Influence Maximization in Social Networks under the Linear Threshold Model.
Proceedings of the ICDM 2010, 2010

2009
Trade-Offs between Stretch Factor and Load-Balancing Ratio in Routing on Growth-Restricted Graphs.
IEEE Trans. Parallel Distributed Syst., 2009

The Proportional-Share Allocation Market for Computational Resources.
IEEE Trans. Parallel Distributed Syst., 2009

2008
Well Separated Pair Decomposition.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Truth-Telling Reservations.
Algorithmica, 2008

2007
On incremental rendering of silhouette maps of a polyhedral scene.
Comput. Geom., 2007

Proportional response dynamics leads to market equilibrium.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2006
Load-Balanced Short-Path Routing in Wireless Networks.
IEEE Trans. Parallel Distributed Syst., 2006

2005
Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications.
SIAM J. Comput., 2005

Tycoon: An implementation of a distributed, market-based resource allocation system.
Multiagent Grid Syst., 2005

Geometric spanners for routing in mobile networks.
IEEE J. Sel. Areas Commun., 2005

Ensuring Trust in One Time Exchanges: Solving the QoS Problem
CoRR, 2005

A price-anticipating resource allocation mechanism for distributed shared clusters.
Proceedings of the Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), 2005

GLIDER: gradient landmark-based distributed routing for sensor networks.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

The Efficiency and Fairness of a Fixed Budget Resource Allocation Game.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004
Tycoon: an Implementation of a Distributed, Market-based Resource Allocation System
CoRR, 2004

Kinetic collision detection between two simple polygons.
Comput. Geom., 2004

Collision detection for deforming necklaces.
Comput. Geom., 2004

Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Fractionally cascaded information in a sensor network.
Proceedings of the Third International Symposium on Information Processing in Sensor Networks, 2004

2003
TreeJuxtaposer: scalable tree comparison using Focus+Context with guaranteed visibility.
ACM Trans. Graph., 2003

Probabilistic Analysis for Discrete Attributes of Moving Points.
Int. J. Comput. Geom. Appl., 2003

Discrete Mobile Centers.
Discret. Comput. Geom., 2003

On the complexity of distance-based evolutionary tree reconstruction.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Zonotopes as bounding volumes.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002
Fault-Tolerant Meshes with Small Degree.
IEEE Trans. Computers, 2002

Deformable Free-Space Tilings for Kinetic Collision Detection.
Int. J. Robotics Res., 2002

Visibility Queries and Maintenance in Simple Polygons.
Discret. Comput. Geom., 2002

Myriad: Cost-Effective Disaster Tolerance.
Proceedings of the FAST '02 Conference on File and Storage Technologies, 2002

Collision detection for deforming necklaces.
Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

2001
Kinetic Connectivity for Unit Disks.
Discret. Comput. Geom., 2001

Geometric spanner for routing in mobile networks.
Proceedings of the 2nd ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2001

Kinetic Collision Detection: Algorithms and Experiments.
Proceedings of the 2001 IEEE International Conference on Robotics and Automation, 2001

2000
Kinetic maintenance of proximity structures.
PhD thesis, 2000

A hierarchical method for real-time distance computation among moving convex bodies.
Comput. Geom., 2000

Compact Voronoi Diagrams for Moving Convex Polygons.
Proceedings of the Algorithm Theory, 2000

1999
Separation-Sensitive Collision Detection for Convex Objects.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

<i>H-Walk</i>: Hierarchical Distance Computation for Moving Convex Bodies.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

Kinetic Data Structures: Animating Proofs Through Time.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998
Visibility Queries in Simple Polygons and Applications.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Euclidean proximity and power diagrams.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997
Probabilistic Analysis for Combinatorial Functions of Moving Points.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Proximity Problems on Moving Points.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

A Practical Evaluation of Kinetic Data Structures.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997


  Loading...