Anup B. Rao

Orcid: 0009-0004-7226-7860

Affiliations:
  • Adobe Research, San Jose, CA, USA
  • Yale University, New Haven, CT, USA (former)


According to our database1, Anup B. Rao authored at least 64 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Hallucination Diversity-Aware Active Learning for Text Summarization.
Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers), 2024

RECON: Training-Free Acceleration for Text-to-Image Synthesis with Retrieval of Concept Prompt Trajectories.
Proceedings of the Computer Vision - ECCV 2024, 2024

DeCoT: Debiasing Chain-of-Thought for Knowledge-Intensive Tasks in Large Language Models via Causal Intervention.
Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2024

2023
Dynamic Vector Bin Packing for Online Resource Allocation in the Cloud.
CoRR, 2023

Brief Announcement: Dynamic Vector Bin Packing for Online Resource Allocation in the Cloud.
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Finite Population Regression Adjustment and Non-asymptotic Guarantees for Treatment Effect Estimation.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Exact Representation of Sparse Networks with Symmetric Nonnegative Embeddings.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Decentralized Personalized Online Federated Learning.
Proceedings of the IEEE International Conference on Big Data, 2023

Near Neighbor Search for Constraint Queries.
Proceedings of the IEEE International Conference on Big Data, 2023

Optimal Sketching Bounds for Sparse Linear Regression.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Electra: Conditional Generative Model based Predicate-Aware Query Approximation.
CoRR, 2022

Efficient Insights Discovery through Conditional Generative Model based Query Approximation.
Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Sample Constrained Treatment Effect Estimation.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

One-Pass Algorithms for MAP Inference of Nonsymmetric Determinantal Point Processes.
Proceedings of the International Conference on Machine Learning, 2022

Online Balanced Experimental Design.
Proceedings of the International Conference on Machine Learning, 2022

Conditional Generative Model Based Predicate-Aware Query Approximation.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Heterogeneous Graphlets.
ACM Trans. Knowl. Discov. Data, 2021

Online MAP Inference and Learning for Nonsymmetric Determinantal Point Processes.
CoRR, 2021

An Interpretable Graph Generative Model with Heterophily.
CoRR, 2021

Multiscale Manifold Warping.
CoRR, 2021

Optimal Space and Time for Streaming Pattern Matching.
CoRR, 2021

Coresets for Classification - Simplified and Strengthened.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Interactive Audience Expansion On Large Scale Online Visitor Data.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Asymptotics of Ridge Regression in Convolutional Models.
Proceedings of the 38th International Conference on Machine Learning, 2021

Fundamental Tradeoffs in Distributionally Adversarial Training.
Proceedings of the 38th International Conference on Machine Learning, 2021

Machine Unlearning via Algorithmic Stability.
Proceedings of the Conference on Learning Theory, 2021

From Closing Triangles to Higher-Order Motif Closures for Better Unsupervised Online Link Prediction.
Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

Designing Transportable Experiments Under S-admissability.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Efficient Balanced Treatment Assignments for Experimentation.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Graph Neural Networks with Heterophily.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Determinant-Preserving Sparsification of SDDM Matrices.
SIAM J. Comput., 2020

Fast and Accurate Estimation of Typed Graphlets.
Proceedings of the Companion of The 2020 Web Conference 2020, 2020

From Closing Triangles to Closing Higher-Order Motifs.
Proceedings of the Companion of The 2020 Web Conference 2020, 2020

Real-Time Clustering for Large Sparse Online Visitor Data.
Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

A Structural Graph Representation Learning Framework.
Proceedings of the WSDM '20: The Thirteenth ACM International Conference on Web Search and Data Mining, 2020

Approximate Maximum Matching in Random Streams.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Dynamic Clustering with Discrete Time Event Prediction.
Proceedings of the 43rd International ACM SIGIR conference on research and development in Information Retrieval, 2020

Model Selection in Contextual Stochastic Bandit Problems.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Higher-order Clustering in Complex Heterogeneous Networks.
Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

2019
Higher-Order Ranking and Link Prediction: From Closing Triangles to Closing Higher-Order Motifs.
CoRR, 2019

Heterogeneous Network Motifs.
CoRR, 2019

Efficient Second-Order Shape-Constrained Function Fitting.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

On Densification for Minwise Hashing.
Proceedings of the Thirty-Fifth Conference on Uncertainty in Artificial Intelligence, 2019

Hacd: Hierarchical Agglomerative Community Detection In Social Networks.
Proceedings of the 29th IEEE International Workshop on Machine Learning for Signal Processing, 2019

Latent Network Summarization: Bridging Network Embedding and Summarization.
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

Graph Convolutional Networks with Motif-based Attention.
Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019

Sample Efficient Graph-Based Optimization with Noisy Observations.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
Bridging Network Embedding and Graph Summarization.
CoRR, 2018

Higher-order Spectral Clustering for Heterogeneous Graphs.
CoRR, 2018

Higher-order Graph Convolutional Networks.
CoRR, 2018

New Insights into Bootstrapping for Bandits.
CoRR, 2018

Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
Stochastic Low-Rank Bandits.
CoRR, 2017

Concave Flow on Small Depth Directed Networks.
CoRR, 2017

Sampling random spanning trees faster than matrix multiplication.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016
Agnostic Estimation of Mean and Covariance.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015
Fast, Provable Algorithms for Isotonic Regression in all ℓ<sub>p</sub>-norms.
CoRR, 2015

Fast, Provable Algorithms for Isotonic Regression in all L_p-norms.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Algorithms for Lipschitz Learning on Graphs.
Proceedings of The 28th Conference on Learning Theory, 2015

Stochastic Block Model and Community Detection in Sparse Graphs: A spectral algorithm with optimal rate of recovery.
Proceedings of The 28th Conference on Learning Theory, 2015

2014
Preconditioning in Expectation.
CoRR, 2014

Solving SDD linear systems in nearly <i>m</i>log<sup>1/2</sup><i>n</i> time.
Proceedings of the Symposium on Theory of Computing, 2014


  Loading...