Jian Li

Yuval Rabani

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

AKE-GNN: Effective Graph Learning with Adaptive Knowledge Exchange.

[BibT_eX]

[DOI]

Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, 2023

2022

Adapative algorithms for crowd-aided categorization.

[BibT_eX]

[DOI]

VLDB J., 2022

Simple and Optimal Stochastic Gradient Methods for Nonsmooth Nonconvex Optimization.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2022

Approximation algorithms for clustering with dynamic points.

[BibT_eX]

[DOI]

Shichuan Deng

Yuval Rabani

J. Comput. Syst. Sci., 2022

Optimal in-place suffix sorting.

[BibT_eX]

[DOI]

Hongwei Huo

Inf. Comput., 2022

Towards Optimal Coreset Construction for (k, z)-Clustering: Breaking the Quadratic Dependency on k.

[BibT_eX]

[DOI]

Xuan Wu

CoRR, 2022

Generalization Bounds for Gradient Methods via Discrete and Continuous Prior.

[BibT_eX]

[DOI]

Xuanyuan Luo

CoRR, 2022

Multi-token Markov Game with Switching Costs.

[BibT_eX]

[DOI]

Daogao Liu

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Learning to Break the Loop: Analyzing and Mitigating Repetitions for Neural Text Generation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Analyzing and Mitigating Interference in Neural Architecture Search.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

AutoHEnsGNN: Winning Solution to AutoGraph Challenge for KDD Cup 2020.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Synthesizing Privacy Preserving Entity Resolution Datasets.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

2021

Markov Game with Switching Costs.

[BibT_eX]

[DOI]

Daogao Liu

CoRR, 2021

Graph Symbiosis Learning.

[BibT_eX]

[DOI]

CoRR, 2021

NAS-BERT: Task-Agnostic and Adaptive-Size BERT Compression with Neural Architecture Search.

[BibT_eX]

[DOI]

Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Return-Based Contrastive Representation Learning for Reinforcement Learning.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Learning Representations, 2021

Exploration by Maximizing Renyi Entropy for Reward-Free RL Framework.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Approximation algorithms for the connected sensor cover problem.

[BibT_eX]

[DOI]

Qicai Shi

Theor. Comput. Sci., 2020

Efficient Algorithms for Crowd-Aided Categorization.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2020

Exploration by Maximizing Rényi Entropy for Zero-Shot Meta RL.

[BibT_eX]

[DOI]

CoRR, 2020

Human-in-the-loop Outlier Detection.

[BibT_eX]

[DOI]

Proceedings of the 2020 International Conference on Management of Data, 2020

LRSpeech: Extremely Low-Resource Speech Synthesis and Recognition.

[BibT_eX]

[DOI]

Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

Algorithms and Adaptivity Gaps for Stochastic k-TSP.

[BibT_eX]

[DOI]

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Gradient Descent Maximizes the Margin of Homogeneous Neural Networks.

[BibT_eX]

[DOI]

Kaifeng Lyu

Proceedings of the 8th International Conference on Learning Representations, 2020

On Generalization Error Bounds of Noisy Gradient Methods for Non-Convex Learning.

[BibT_eX]

[DOI]

Xuanyuan Luo

Proceedings of the 8th International Conference on Learning Representations, 2020

DoubleEnsemble: A New Ensemble Method Based on Sample Reweighting and Feature Selection for Financial Data Analysis.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE International Conference on Data Mining, 2020

An Adaptive Master-Slave Regularized Model for Unexpected Revenue Prediction Enhanced with Alternative Data.

[BibT_eX]

[DOI]

Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

A Fast Anderson-Chebyshev Acceleration for Nonlinear Optimization.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Policy Search by Target Distribution Learning for Continuous Control.

[BibT_eX]

[DOI]

Chuheng Zhang

Yuanqi Li

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems.

[BibT_eX]

[DOI]

Math. Oper. Res., 2019

Stochastic gradient Hamiltonian Monte Carlo with variance reduction for Bayesian inference.

[BibT_eX]

[DOI]

Mach. Learn., 2019

NetSMF: Large-Scale Network Embedding as Sparse Matrix Factorization.

[BibT_eX]

[DOI]

Proceedings of the World Wide Web Conference, 2019

Relation Extraction with Temporal Reasoning Based on Memory Augmented Distant Supervision.

[BibT_eX]

[DOI]

Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2019

Gradient Boosting with Piece-Wise Linear Regression Trees.

[BibT_eX]

[DOI]

Yu Shi

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2018

Distilling relations using knowledge bases.

[BibT_eX]

[DOI]

VLDB J., 2018

A partial-order-based framework for cost-effective crowdsourced entity resolution.

[BibT_eX]

[DOI]

VLDB J., 2018

Near-linear time approximation schemes for geometric maximum coverage.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

CDB: A Crowd-Powered Database System.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2018

An Anderson-Chebyshev Mixing Method for Nonlinear Optimization.

[BibT_eX]

[DOI]

CoRR, 2018

ε-Coresets for Clustering (with Outliers) in Doubling Metrics.

[BibT_eX]

[DOI]

CoRR, 2018

Stochastic Gradient Hamiltonian Monte Carlo with Variance Reduction for Bayesian Inference.

[BibT_eX]

[DOI]

Tianyi Zhang

CoRR, 2018

Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec.

[BibT_eX]

[DOI]

Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, 2018

SVM via Saddle Point Optimization: New Bounds and Distributed Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality.

[BibT_eX]

[DOI]

Min Xie

Raymond Chi-Wing Wong

Cheng Long

Ashwin Lall

Proceedings of the 2018 International Conference on Management of Data, 2018

A Two-Stage Mechanism for Ordinal Peer Assessment.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

A Simple Proximal Stochastic Gradient Method for Nonsmooth Nonconvex Optimization.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

BRITS: Bidirectional Recurrent Imputation for Time Series.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics.

[BibT_eX]

[DOI]

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Odd Yao-Yao Graphs are Not Spanners.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Computational Geometry, 2018

When Will You Arrive? Estimating Travel Time Based on Deep Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Odd Yao-Yao Graphs may Not be Spanners.

[BibT_eX]

[DOI]

CoRR, 2017

Linear Time Approximation Schemes for Geometric Maximum Coverage.

[BibT_eX]

[DOI]

CoRR, 2017

Practical Algorithms for Best-K Identification in Multi-Armed Bandits.

[BibT_eX]

[DOI]

Haotian Jiang

CoRR, 2017

Improved Algorithms For Structured Sparse Recovery.

[BibT_eX]

[DOI]

CoRR, 2017

Capacitated Center Problems with Two-Sided Bounds and Outliers.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Stochastic k-Center and j-Flat-Center Problems.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

CDB: Optimizing Queries with Crowd-Based Selections and Joins.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM International Conference on Management of Data, 2017

Learning Gradient Descent: Better Generalization and Longer Horizons.

[BibT_eX]

[DOI]

Kaifeng Lv

Shunhua Jiang

Proceedings of the 34th International Conference on Machine Learning, 2017

k-Regret Minimizing Set: Efficient Algorithms and Hardness.

[BibT_eX]

[DOI]

Raymond Chi-Wing Wong

Proceedings of the 20th International Conference on Database Theory, 2017

DeepSD: Supply-Demand Prediction for Online Car-Hailing Services Using Deep Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

Cleaning Relations Using Knowledge Bases.

[BibT_eX]

[DOI]

Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

Towards Instance Optimal Bounds for Best Arm Identification.

[BibT_eX]

[DOI]

Proceedings of the 30th Conference on Learning Theory, 2017

Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration.

[BibT_eX]

[DOI]

Proceedings of the 30th Conference on Learning Theory, 2017

Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017

2016

Range queries on uncertain data.

[BibT_eX]

[DOI]

Mohammad Taghi Hajiaghayi

Theor. Comput. Sci., 2016

A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Store Location Selection via Mining Search Query Logs of Baidu Maps.

[BibT_eX]

[DOI]

CoRR, 2016

Stochastic k-Center and j-Flat-Center Problems.

[BibT_eX]

[DOI]

CoRR, 2016

Matroid and Knapsack Center Problems.

[BibT_eX]

[DOI]

Algorithmica, 2016

Cost-Effective Crowdsourced Entity Resolution: A Partial-Order Approach.

[BibT_eX]

[DOI]

Proceedings of the 2016 International Conference on Management of Data, 2016

Combinatorial Multi-Armed Bandit with General Reward Functions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

K-Means Clustering with Distributed Dimensions.

[BibT_eX]

[DOI]

Proceedings of the 33nd International Conference on Machine Learning, 2016

Automatic user identification method across heterogeneous mobility data sources.

[BibT_eX]

[DOI]

Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

DESTPRE: a data-driven approach to destination prediction for taxi rides.

[BibT_eX]

[DOI]

Mengwen Xu

Dong Wang

Proceedings of the 2016 ACM International Joint Conference on Pervasive and Ubiquitous Computing, 2016

Demand driven store site selection via multiple spatial-temporal data.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS 2016, Burlingame, California, USA, October 31, 2016

Almost All Even Yao-Yao Graphs Are Spanners.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

epsilon-Kernel Coresets for Stochastic Points.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

ETCPS: An Effective and Scalable Traffic Condition Prediction System.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2016

Open Problem: Best Arm Identification: Almost Instance-Wise Optimality and the Gap Entropy Conjecture.

[BibT_eX]

[DOI]

Proceedings of the 29th Conference on Learning Theory, 2016

Pure Exploration of Multi-armed Bandit Under Matroid Constraints.

[BibT_eX]

[DOI]

Anupam Gupta

Proceedings of the 29th Conference on Learning Theory, 2016

2015

On the Energy Efficiency of Device Discovery in Mobile Opportunistic Networks: A Systematic Approach.

[BibT_eX]

[DOI]

Bo Han

Aravind Srinivasan

IEEE Trans. Mob. Comput., 2015

Efficient algorithms for the one-dimensional k-center problem.

[BibT_eX]

[DOI]

Danny Ziyi Chen

Theor. Comput. Sci., 2015

Balanced splitting on weighted intervals.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2015

On the Optimal Sample Complexity for Best Arm Identification.

[BibT_eX]

[DOI]

CoRR, 2015

Learning Arbitrary Statistical Mixtures of Discrete Distributions.

[BibT_eX]

[DOI]

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Efficient Similarity Join and Search on Multi-Attribute Data.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

Stochastic Online Greedy Learning with Semi-bandit Feedbacks.

[BibT_eX]

[DOI]

Tian Lin

Wei Chen

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

On Top-k Selection in Multi-Armed Bandits and Hidden Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

A PTAS for the Weighted Unit Disk Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Linear Time Approximation Schemes for Geometric Maximum Coverage.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014

Your Friends Have More Friends Than You Do: Identifying Influential Mobile Users Through Random-Walk Sampling.

[BibT_eX]

[DOI]

Bo Han

Aravind Srinivasan

IEEE/ACM Trans. Netw., 2014

Trinary-Projection Trees for Approximate Nearest Neighbor Search.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 2014

A fully polynomial-time approximation scheme for approximating a sum of random variables.

[BibT_eX]

[DOI]

Tianlin Shi

Oper. Res. Lett., 2014

$ε$-Kernel Coresets for Stochastic Points.

[BibT_eX]

[DOI]

Jeff M. Phillips

CoRR, 2014

A pruning algorithm for optimal diversified search.

[BibT_eX]

[DOI]

Proceedings of the 23rd International World Wide Web Conference, 2014

The multi-shop ski rental problem.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2014

Optimal PAC Multiple Arm Identification with Applications to Crowdsourcing.

[BibT_eX]

[DOI]

Yuan Zhou

Xi Chen

Proceedings of the 31th International Conference on Machine Learning, 2014

Egalitarian pairwise kidney exchange: fast algorithms vialinear programming and parametric flow.

[BibT_eX]

[DOI]

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013

Scalable Column Concept Determination for Web Tables Using Large Knowledge Bases.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2013

Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

Revenue Optimization for Group-Buying Websites

[BibT_eX]

[DOI]

CoRR, 2013

An FPTAS for Approximating a Sum of Random Variables

[BibT_eX]

[DOI]

Tianlin Shi

CoRR, 2013

Efficient Algorithms for One-Dimensional k-Center Problems

[BibT_eX]

[DOI]

Danny Z. Chen

Mohammad Taghi Hajiaghayi

CoRR, 2013

A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median.

[BibT_eX]

[DOI]

CoRR, 2013

Optimal Allocation for Chunked-Reward Advertising.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Stochastic combinatorial optimization via poisson approximation.

[BibT_eX]

[DOI]

Wen Yuan

Proceedings of the Symposium on Theory of Computing Conference, 2013

Ranking with Diverse Intents and Correlated Contents.

[BibT_eX]

[DOI]

Zeyu Zhang

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012

The load-distance balancing problem.

[BibT_eX]

[DOI]

Networks, 2012

Minimum Spanning Trees, Perfect Matchings and Cycle Covers Over Stochastic Points in Metric Spaces

[BibT_eX]

[DOI]

CoRR, 2012

When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings.

[BibT_eX]

[DOI]

Algorithmica, 2012

2011

Decision making under uncertainty.

[BibT_eX]

[DOI]

PhD thesis, 2011

DataSynth: Generating Synthetic Data using Declarative Constraints.

[BibT_eX]

[DOI]

Arvind Arasu

Raghav Kaushik

Proc. VLDB Endow., 2011

Generalized Machine Activation Problems.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Sensitivity analysis and explanations for robust query evaluation in probabilistic databases.

[BibT_eX]

[DOI]

Bhargav Kanagal

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2011

Data generation using declarative constraints.

[BibT_eX]

[DOI]

Arvind Arasu

Raghav Kaushik

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2011

2010

Ranking Continuous Probabilistic Datasets.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2010

Utility Maximization under Uncertainty

[BibT_eX]

[DOI]

CoRR, 2010

Densest k-Subgraph Approximation on Intersection Graphs.

[BibT_eX]

[DOI]

Danny Z. Chen

Rudolf Fleischer

Richard Matthew McCutchen

Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

New Models and Algorithms for Throughput Maximization in Broadcast Scheduling - (Extended Abstract).

[BibT_eX]

[DOI]

Benjamin Moseley

Louiqa Raschid

Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

On Computing Compression Trees for Data Collection in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Clustering with Diversity.

[BibT_eX]

[DOI]

Ke Yi

Qin Zhang

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

Energy Efficient Scheduling via Partial Shutdown.

[BibT_eX]

[DOI]

Barna Saha

Proceedings of the Scheduling, 14.02. - 19.02.2010, 2010

2009

A Unified Approach to Ranking in Probabilistic Databases.

[BibT_eX]

[DOI]

Barna Saha

Proc. VLDB Endow., 2009

An O(log(n)/log(log(n))) upper bound on the price of stability for undirected Shapley network design games.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

On Computing Compression Trees for Data Collection in Sensor Networks

[BibT_eX]

[DOI]

CoRR, 2009

Consensus answers for queries over probabilistic databases.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

Minimizing Communication Cost in Distributed Multi-query Processing.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Data Engineering, 2009

2008

More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding.

[BibT_eX]

[DOI]

Mordecai J. Golin