Blind channel estimation by least squares smoothing. - Lang Tong 001; Qing Zhao 001 (ICASSP, 1998)

Decision feedback blind symbol estimation by adaptive least squares smoothing. - Qing Zhao 001; Lang Tong 001 (ICASSP, 1999)

Joint order detection and blind channel estimation by least squares smoothing. - Lang Tong 001; Qing Zhao 001 (IEEE Trans. Signal Process., 1999)

Adaptive blind channel estimation by least squares smoothing. - Qing Zhao 001; Lang Tong 001 (IEEE Trans. Signal Process., 1999)

Semi-blind collision resolution in random access wireless ad hoc networks. - Qing Zhao 001; Lang Tong 001 (IEEE Trans. Signal Process., 2000)

Multipacket reception in random access wireless networks: from signal processing to optimal medium access control. - Lang Tong 001; Qing Zhao 001; Gökhan Mergen (IEEE Commun. Mag., 2001)

A multiqueue service room MAC protocol for wireless networks with multipacket reception. - Qing Zhao 001; Lang Tong 001 (IEEE/ACM Trans. Netw., 2003)

Distributed opportunistic transmission for wireless sensor networks. - Qing Zhao 001; Lang Tong 001 (ICASSP (3), 2004)

A dynamic queue protocol for multiaccess wireless networks with multipacket reception. - Qing Zhao 001; Lang Tong 001 (IEEE Trans. Wirel. Commun., 2004)

Energy efficient adaptive routing for ad hoc networks with time-varying heterogeneous traffic. - Qing Zhao 001; Lang Tong 001 (ICASSP (5), 2005)

Opportunistic Carrier Sensing for Energy-Efficient Information Retrieval in Sensor Networks. - Qing Zhao 001; Lang Tong 001 (EURASIP J. Wirel. Commun. Netw., 2005)

Energy efficiency of large-scale wireless networks: proactive versus reactive networking. - Qing Zhao 001; Lang Tong 001 (IEEE J. Sel. Areas Commun., 2005)

Cross-Layer Design of Opportunistic Spectrum Access in the Presence of Sensing Error. - Qing Zhao 001; Lang Tong 001; Ananthram Swami; Yunxia Chen (CISS, 2006)

Dynamic Spectrum Access: Signal Processing, Networking, and Regulatory Policy - Qing Zhao 001; Brian M. Sadler (CoRR, 2006)

The interplay between signal processing and networking in sensor networks. - Qing Zhao 001; Ananthram Swami; Lang Tong 001 (IEEE Signal Process. Mag., 2006)

Sensor Networks With Mobile Access: Energy and Capacity Considerations. - Gökhan Mergen; Qing Zhao 001; Lang Tong 001 (IEEE Trans. Commun., 2006)

Low-Complexity Approaches to Spectrum Opportunity Tracking. - Qing Zhao 001; Bhaskar Krishnamachari; Keqin Liu (CrownCom, 2007)

Bursty Traffic in Energy-Constrained Opportunistic Spectrum Access. - Yunxia Chen; Qing Zhao 001; Ananthram Swami (GLOBECOM, 2007)

A Survey of Dynamic Spectrum Access: Signal Processing and Networking Perspectives. - Qing Zhao 001; Ananthram Swami (ICASSP (4), 2007)

Structure and Optimality of Myopic Sensing for Opportunistic Spectrum Access. - Qing Zhao 001; Bhaskar Krishnamachari (ICC, 2007)

On Myopic Sensing for Multi-Channel Opportunistic Access - Qing Zhao 001; Bhaskar Krishnamachari; Keqin Liu (CoRR, 2007)

Decentralized cognitive MAC for opportunistic spectrum access in ad hoc networks: A POMDP framework. - Qing Zhao 001; Lang Tong 001; Ananthram Swami; Yunxia Chen (IEEE J. Sel. Areas Commun., 2007)

Resource-Constrained Signal Processing, Communications, and Networking [From the Guest Editors]. - Qing Zhao 001; Rajit Manohar; Robert J. Ulman; Venugopal V. Veeravalli (IEEE Signal Process. Mag., 2007)

A Survey of Dynamic Spectrum Access. - Qing Zhao 001; Brian M. Sadler (IEEE Signal Process. Mag., 2007)

Energy-Aware Adaptive Routing for Large-Scale Ad Hoc Networks: Protocol and Performance Analysis. - Qing Zhao 001; Lang Tong 001; David Counsil (IEEE Trans. Mob. Comput., 2007)

Energy-efficient information retrieval for correlated source reconstruction in sensor networks. - Qing Zhao 001; Lang Tong 001 (IEEE Trans. Wirel. Commun., 2007)

A Decision-Theoretic Framework for Opportunistic Spectrum Access. - Qing Zhao 001; Ananthram Swami (IEEE Wirel. Commun., 2007)

Session MA3b: Stochastic control and decision theory for cognitive radio networks. - Qing Zhao 001 (ACSCC, 2008)

Channel probing for opportunistic access with multi-channel sensing. - Keqin Liu; Qing Zhao 001 (ACSCC, 2008)

Link throughput of multi-channel opportunistic access with limited sensing. - Keqin Liu; Qing Zhao 001 (ICASSP, 2008)

Optimality of Myopic Sensing in Multi-Channel Opportunistic Access. - Tara Javidi; Bhaskar Krishnamachari; Qing Zhao 001; Mingyan Liu (ICC, 2008)

A negotiation game for multichannel access in cognitive radio networks. - Hua Liu 005; Longbo Huang; Bhaskar Krishnamachari; Qing Zhao 001 (WICON, 2008)

Network configuration for optimal utilization efficiency of wireless sensor networks. - Yunxia Chen; Chen-Nee Chuah; Qing Zhao 001 (Ad Hoc Networks, 2008)

Structure and Optimality of Myopic Policy in Opportunistic Access with Noisy Observations - Qing Zhao 001; Bhaskar Krishnamachari (CoRR, 2008)

A Restless Bandit Formulation of Multi-channel Opportunistic Access: Indexablity and Index Policy - Keqin Liu; Qing Zhao 001 (CoRR, 2008)

Optimality of Myopic Sensing in Multi-Channel Opportunistic Access - Sahand Haji Ali Ahmad; Mingyan Liu; Tara Javidi; Qing Zhao 001; Bhaskar Krishnamachari (CoRR, 2008)

Introduction to the Issue on Signal Processing and Networking for Dynamic Spectrum Access. - Ananthram Swami; Randall A. Berry; Akbar M. Sayeed; Vahid Tarokh; Qing Zhao 001 (IEEE J. Sel. Top. Signal Process., 2008)

Joint Design and Separation Principle for Opportunistic Spectrum Access in the Presence of Sensing Errors. - Yunxia Chen; Qing Zhao 001; Ananthram Swami (IEEE Trans. Inf. Theory, 2008)

Opportunistic Spectrum Access via Periodic Channel Sensing. - Qing Zhao 001; Stefan Geirhofer; Lang Tong 001; Brian M. Sadler (IEEE Trans. Signal Process., 2008)

On myopic sensing for multi-channel opportunistic access: structure, optimality, and performance. - Qing Zhao 001; Bhaskar Krishnamachari; Keqin Liu (IEEE Trans. Wirel. Commun., 2008)

On the myopic policy for a class of restless bandit problems with applications in dynamic multichannel access. - Keqin Liu; Qing Zhao 001 (CDC, 2009)

The Tradeoff between Energy Efficiency and User State Estimation Accuracy in Mobile Sensing. - Yi Wang 035; Bhaskar Krishnamachari; Qing Zhao 001; Murali Annavaram (MobiCASE, 2009)

Connectivity of cognitive radio networks: proximity vs. opportunity. - Wei Ren 007; Qing Zhao 001; Ananthram Swami (CoRoNet@MobiCom, 2009)

Connectivity of Cognitive Radio Networks: Proximity vs. Opportunity - Wei Ren 007; Qing Zhao 001; Drasvin Cheowtirakul; Ananthram Swami (CoRR, 2009)

Opportunistic Spectrum Access in Self-Similar Primary Traffic. - Xiangyang Xiao; Keqin Liu; Qing Zhao 001 (EURASIP J. Adv. Signal Process., 2009)

Power Control in Cognitive Radio Networks: How to Cross a Multi-Lane Highway. - Wei Ren 007; Qing Zhao 001; Ananthram Swami (IEEE J. Sel. Areas Commun., 2009)

Optimality of myopic sensing in multichannel opportunistic access. - Sahand Haji Ali Ahmad; Mingyan Liu; Tara Javidi; Qing Zhao 001; Bhaskar Krishnamachari (IEEE Trans. Inf. Theory, 2009)

Distributed Spectrum Sensing and Access in Cognitive Radio Networks With Energy Constraint. - Yunxia Chen; Qing Zhao 001; Ananthram Swami (IEEE Trans. Signal Process., 2009)

Decentralized multi-armed bandit with imperfect observations. - Keqin Liu; Qing Zhao 001; Bhaskar Krishnamachari (Allerton, 2010)

Distributed learning in cognitive radio networks: Multi-armed bandit with distributed multiple players. - Keqin Liu; Qing Zhao 001 (ICASSP, 2010)

Markov-optimal sensing policy for user state estimation in mobile devices. - Yi Wang 035; Bhaskar Krishnamachari; Qing Zhao 001; Murali Annavaram (IPSN, 2010)

Decentralized multi-armed bandit with multiple distributed players. - Keqin Liu; Qing Zhao 001 (ITA, 2010)

Performance of round robin policies for dynamic multichannel access. - Changmian Wang; Bhaskar Krishnamachari; Qing Zhao 001; Geir E. Øien (ITA, 2010)

Learning in A Changing World: Non-Bayesian Restless Multi-Armed Bandit - Haoyang Liu; Keqin Liu; Qing Zhao 001 (CoRR, 2010)

Indexability of Restless Bandit Problems and Optimality of Whittle Index for Dynamic Multichannel Access. - Keqin Liu; Qing Zhao 001 (IEEE Trans. Inf. Theory, 2010)

Distributed learning in multi-armed bandit with multiple players. - Keqin Liu; Qing Zhao 001 (IEEE Trans. Signal Process., 2010)

Dynamic multichannel access with imperfect channel state detection. - Keqin Liu; Qing Zhao 001; Bhaskar Krishnamachari (IEEE Trans. Signal Process., 2010)

Trust, opinion diffusion and radicalization in social networks. - Lin Li 005; Anna Scaglione; Ananthram Swami; Qing Zhao 001 (ACSCC, 2011)

Dynamic pricing under binary demand uncertainty: A multi-armed bandit with correlated arms. - Yixuan Zhai; Pouya Tehrani; Lin Li 005; Jiang Zhao; Qing Zhao 001 (ACSCC, 2011)

Multi-armed bandit problems with heavy-tailed reward distributions. - Keqin Liu; Qing Zhao 001 (Allerton, 2011)

Multi-channel opportunistic spectrum access in unslotted primary systems with unknown models. - Pouya Tehrani; Qing Zhao 001; Lang Tong 001 (CAMSAP, 2011)

Indexability and whittle index for restless bandit problems involving reset processes. - Keqin Liu; Richard Weber 003; Qing Zhao 001 (CDC/ECC, 2011)

The non-Bayesian restless multi-armed bandit: A case of near-logarithmic regret. - Wenhan Dai; Yi Gai; Bhaskar Krishnamachari; Qing Zhao 001 (ICASSP, 2011)

Logarithmic weak regret of non-Bayesian restless multi-armed bandit. - Haoyang Liu; Keqin Liu; Qing Zhao 001 (ICASSP, 2011)

Learning and sharing in a changing world: Non-Bayesian restless bandit with multiple players. - Haoyang Liu; Keqin Liu; Qing Zhao 001 (ITA, 2011)

Decentralized Restless Bandit with Multiple Players and Unknown Dynamics - Haoyang Liu; Keqin Liu; Qing Zhao 001 (CoRR, 2011)

Deterministic Sequencing of Exploration and Exploitation for Multi-Armed Bandit Problems - Keqin Liu; Qing Zhao 001 (CoRR, 2011)

The Non-Bayesian Restless Multi-Armed Bandit: A Case of Near-Logarithmic Strict Regret - Wenhan Dai; Yi Gai; Bhaskar Krishnamachari; Qing Zhao 001 (CoRR, 2011)

Extended UCB Policy for Multi-Armed Bandit with Light-Tailed Reward Distributions - Keqin Liu; Qing Zhao 001 (CoRR, 2011)

On the Connectivity and Multihop Delay of Ad Hoc Cognitive Radio Networks. - Wei Ren 007; Qing Zhao 001; Ananthram Swami (IEEE J. Sel. Areas Commun., 2011)

Connectivity of Heterogeneous Wireless Networks. - Wei Ren 007; Qing Zhao 001; Ananthram Swami (IEEE Trans. Inf. Theory, 2011)

Strategic communications in opinion diffusion. - Lin Li 005; Anna Scaglione; Ananthram Swami; Qing Zhao 001 (ACSCC, 2012)

The thinnest path problem for secure communications: A directed hypergraph approach. - Jianhang Gao; Qing Zhao 001; Ananthram Swami (Allerton Conference, 2012)

Phase transition in opinion diffusion in social networks. - Lin Li 005; Anna Scaglione; Ananthram Swami; Qing Zhao 001 (ICASSP, 2012)

Delay optimal multichannel opportunistic access. - Shiyao Chen; Lang Tong 001; Qing Zhao 001 (INFOCOM, 2012)

Dynamic intrusion detection in resource-constrained cyber networks. - Keqin Liu; Qing Zhao 001 (ISIT, 2012)

Online learning for stochastic linear optimization problems. - Keqin Liu; Qing Zhao 001 (ITA, 2012)

Adaptive shortest-path routing under unknown and stochastically varying link states. - Keqin Liu; Qing Zhao 001 (WiOpt, 2012)

Distributed Flow Scheduling in Unknown Environment - Yaoqing Yang; Keqin Liu; Qing Zhao 001 (CoRR, 2012)

Opportunistic spectrum access in unslotted primary systems. - Pouya Tehrani; Keqin Liu; Qing Zhao 001 (J. Frankl. Inst., 2012)

Asymptotically Efficient Multichannel Estimation for Opportunistic Spectrum Access. - Pouya Tehrani; Lang Tong 001; Qing Zhao 001 (IEEE Trans. Signal Process., 2012)

Cooperative Game in Dynamic Spectrum Access with Unknown Model and Imperfect Sensing. - Keqin Liu; Qing Zhao 001 (IEEE Trans. Wirel. Commun., 2012)

Distributed node-weighted connected dominating set problems. - Sattar Vakili; Qing Zhao 001 (ACSSC, 2013)

Achieving complete learning in Multi-Armed Bandit problems. - Sattar Vakili; Qing Zhao 001 (ACSSC, 2013)

Retail pricing for stochastic demand with unknown parameters: An online machine learning approach. - Liyan Jia; Qing Zhao 001; Lang Tong 001 (Allerton, 2013)

Opportunistic routing under unknown stochastic models. - Pouya Tehrani; Qing Zhao 001; Tara Javidi (CAMSAP, 2013)

Optimal index policies for quickest localization of anomaly in cyber networks. - Kobi Cohen; Qing Zhao 001; Ananthram Swami (GlobalSIP, 2013)

Dynamic probing for intrusion detection under resource constraints. - Keqin Liu; Qing Zhao 001; Ananthram Swami (ICC, 2013)

Consensus, Polarization and Clustering of Opinions in Social Networks. - Lin Li 005; Anna Scaglione; Ananthram Swami; Qing Zhao 001 (IEEE J. Sel. Areas Commun., 2013)

Deterministic Sequencing of Exploration and Exploitation for Multi-Armed Bandit Problems. - Sattar Vakili; Keqin Liu; Qing Zhao 001 (IEEE J. Sel. Top. Signal Process., 2013)

Introduction to the Issue on Learning-Based Decision Making in Dynamic Systems Under Uncertainty. - Qing Zhao 001; Edwin K. P. Chong; Bhaskar Krishnamachari; Amir Leshem; Sean P. Meyn; Venugopal V. Veeravalli (IEEE J. Sel. Top. Signal Process., 2013)

Learning in a Changing World: Restless Multiarmed Bandit With Unknown Dynamics. - Haoyang Liu; Keqin Liu; Qing Zhao 001 (IEEE Trans. Inf. Theory, 2013)

Broadcasting in multi-radio multi-channel wireless networks using simplicial complexes. - Wei Ren 007; Qing Zhao 001; Ram Ramanathan; Jianhang Gao; Ananthram Swami; Amotz Bar-Noy; Matthew P. Johnson 001; Prithwish Basu (Wirel. Networks, 2013)

Restless multi-armed bandits under time-varying activation constraints for dynamic spectrum access. - Kobi Cohen; Qing Zhao 001; Anna Scaglione (ACSSC, 2014)

Time-varying stochastic multi-armed bandit problems. - Sattar Vakili; Qing Zhao 001; Yuan Zhou 002 (ACSSC, 2014)

Anomaly detection over independent processes: Switching with memory. - Kobi Cohen; Qing Zhao 001 (Allerton, 2014)

Quickest anomaly detection: A case of active hypothesis testing. - Kobi Cohen; Qing Zhao 001 (ITA, 2014)

Active Hypothesis Testing for Quickest Anomaly Detection. - Kobi Cohen; Qing Zhao 001 (CoRR, 2014)

Asymptotically Optimal Sequential Tests for Anomaly Detection: Switching with Memory. - Kobi Cohen; Qing Zhao 001 (CoRR, 2014)

Minimum Information Dominating Set for Opinion Sampling. - Jianhang Gao; Qing Zhao 001; Ananthram Swami (CoRR, 2014)

Temporal Traffic Dynamics Improve the Connectivity of Ad Hoc Cognitive Radio Networks. - Wei Ren 007; Qing Zhao 001; Ananthram Swami (IEEE/ACM Trans. Netw., 2014)

Optimal Index Policies for Anomaly Localization in Resource-Constrained Cyber Systems. - Kobi Cohen; Qing Zhao 001; Ananthram Swami (IEEE Trans. Signal Process., 2014)

Mean-variance and value at risk in multi-armed bandit problems. - Sattar Vakili; Qing Zhao 001 (Allerton, 2015)

Bayesian quickest short-term voltage instability detection in power systems. - Sattar Vakili; Qing Zhao 001; Lang Tong 001 (CDC, 2015)

Minimum information dominating set for critical sampling over graphs. - Jianhang Gao; Qing Zhao 001; Ananthram Swami (ICASSP, 2015)

Risk-averse online learning under mean-variance measures. - Sattar Vakili; Qing Zhao 001 (ICASSP, 2015)

Quickest detection of short-term voltage instability with PMU measurements. - Sattar Vakili; Qing Zhao 001; Lang Tong 001 (ICASSP, 2015)

Group testing under sum observations for heavy hitter detection. - Chao Wang 013; Qing Zhao 001; Chen-Nee Chuah (ITA, 2015)

Active Hypothesis Testing for Anomaly Detection. - Kobi Cohen; Qing Zhao 001 (IEEE Trans. Inf. Theory, 2015)

Dynamic Shortest Path Algorithms for Hypergraphs. - Jianhang Gao; Qing Zhao 001; Wei Ren 007; Ananthram Swami; Ram Ramanathan; Amotz Bar-Noy (IEEE/ACM Trans. Netw., 2015)

The Thinnest Path Problem. - Jianhang Gao; Qing Zhao 001; Ananthram Swami (IEEE/ACM Trans. Netw., 2015)

Asymptotically Optimal Anomaly Detection via Sequential Testing. - Kobi Cohen; Qing Zhao 001 (IEEE Trans. Signal Process., 2015)

Online learning and optimization of Markov jump linear models. - Sevi Baltaoglu; Lang Tong 001; Qing Zhao 001 (ICASSP, 2016)

Asymptotically optimal search of unknown anomalies. - Bar Hemo; Kobi Cohen; Qing Zhao 001 (ISSPIT, 2016)

Online learning and pricing for demand response in smart distribution networks. - Sevi Baltaoglu; Lang Tong 001; Qing Zhao 001 (SSP, 2016)

Online Learning and Optimization of Markov Jump Affine Models. - Sevi Baltaoglu; Lang Tong 001; Qing Zhao 001 (CoRR, 2016)

Risk-Averse Multi-Armed Bandit Problems Under Mean-Variance Measure. - Sattar Vakili; Qing Zhao 001 (IEEE J. Sel. Top. Signal Process., 2016)

The Minimum Information Dominating Set for Opinion Sampling in Social Networks. - Jianhang Gao; Qing Zhao 001; Ananthram Swami (IEEE Trans. Netw. Sci. Eng., 2016)

Anomaly detection under a nonlinear system cost objective function. - Andrey Gurevich; Kobi Cohen; Qing Zhao 001 (Allerton, 2017)

Active hypothesis testing on a tree: Anomaly detection under hierarchical observations. - Chao Wang 013; Kobi Cohen; Qing Zhao 001 (ISIT, 2017)

Spread, then target, and advertise in waves: Optimal capital allocation across advertising channels. - Soheil Eshghi; Victor M. Preciado; Saswati Sarkar; Santosh S. Venkatesh; Qing Zhao 001; Raissa M. D'Souza; Ananthram Swami (ITA, 2017)

Online learning with side information. - Xiao Xu; Sattar Vakili; Qing Zhao 001; Ananthram Swami (MILCOM, 2017)

Online Learning of Optimal Bidding Strategy in Repeated Multi-Commodity Auctions. - M. Sevi Baltaoglu; Lang Tong 001; Qing Zhao 001 (NIPS, 2017)

Sequential Active Detection of Anomalies in Heterogeneous Processes. - Boshuang Huang; Kobi Cohen; Qing Zhao 001 (CoRR, 2017)

Anomaly Detection in Hierarchical Data Streams under Unknown Models. - Sattar Vakili; Qing Zhao 001; Chang Liu; Chen-Nee Chuah (CoRR, 2017)

Utility Maximizing Sequential Sensing Over a Finite Horizon. - Lorenzo Ferrari; Qing Zhao 001; Anna Scaglione (IEEE Trans. Signal Process., 2017)

Learning from Dissimilarity. - Xiao Xu; Qing Zhao 001; Ananthram Swami (ACSSC, 2018)

Hierarchical Heavy Hitter Detection Under Unknown Models. - Sattar Vakili; Qing Zhao 001; Chang Liu; Chen-Nee Chuah (ICASSP, 2018)

Learning Ordinal Information Under Bipartite Stochastic Block Models. - Xiao Xu; Qing Zhao 001; Ananthram Swami (MILCOM, 2018)

Dynamic Search on a Tree with Information-Directed Random Walk. - Chao Wang 013; Qing Zhao 001; Kobi Cohen (SPAWC, 2018)

Algorithmic Bidding for Virtual Trading in Electricity Markets. - Sevi Baltaoglu; Lang Tong 001; Qing Zhao 001 (CoRR, 2018)

Multi-Armed Bandits on Unit Interval Graphs. - Xiao Xu; Sattar Vakili; Qing Zhao 001; Ananthram Swami (CoRR, 2018)

Optimal Nested Test Plan for Combinatorial Quantitative Group Testing. - Chao Wang 013; Qing Zhao 001; Chen-Nee Chuah (IEEE Trans. Signal Process., 2018)

Stochastic Gradient Descent on a Tree: an Adaptive and Robust Approach to Stochastic Convex Optimization. - Sattar Vakili; Sudeep Salgia; Qing Zhao 001 (Allerton, 2019)

Decision Variance in Risk-Averse Online Learning. - Sattar Vakili; Alexis Boukouvalas; Qing Zhao 001 (CDC, 2019)

A Random Walk Approach to First-Order Stochastic Convex Optimization. - Sattar Vakili; Qing Zhao 001 (ISIT, 2019)

Disagreement-based Active Learning in Online Settings. - Boshuang Huang; Qing Zhao 001 (CoRR, 2019)

Active Anomaly Detection in Heterogeneous Processes. - Boshuang Huang; Kobi Cohen; Qing Zhao 001 (IEEE Trans. Inf. Theory, 2019)

Sequential Anomaly Detection Under a Nonlinear System Cost. - Andrey Gurevich; Kobi Cohen; Qing Zhao 001 (IEEE Trans. Signal Process., 2019)

Multi-Armed Bandits: Theory and Applications to Online Learning in Networks - Qing Zhao 001 (Multi-Armed Bandits, 2019)

Stochastic Coordinate Minimization with Progressive Precision for Stochastic Convex Optimization. - Sudeep Salgia; Qing Zhao 001; Sattar Vakili (ICML, 2020)

Distributed No-Regret Learning in Multi-Agent Systems. - Xiao Xu; Qing Zhao 001 (CoRR, 2020)

Memory-Constrained No-Regret Learning in Adversarial Bandits. - Xiao Xu; Qing Zhao 001 (CoRR, 2020)

A Computationally Efficient Approach to Black-box Optimization using Gaussian Process Models. - Sudeep Salgia; Sattar Vakili; Qing Zhao 001 (CoRR, 2020)

Distributed No-Regret Learning in Multiagent Systems: Challenges and Recent Developments. - Xiao Xu; Qing Zhao 001 (IEEE Signal Process. Mag., 2020)

Spread, Then Target, and Advertise in Waves: Optimal Budget Allocation Across Advertising Channels. - Soheil Eshghi; Victor M. Preciado; Saswati Sarkar; Santosh S. Venkatesh; Qing Zhao 001; Raissa M. D'Souza; Ananthram Swami (IEEE Trans. Netw. Sci. Eng., 2020)

Multi-Armed Bandits on Partially Revealed Unit Interval Graphs. - Xiao Xu; Sattar Vakili; Qing Zhao 001; Ananthram Swami (IEEE Trans. Netw. Sci. Eng., 2020)

Searching for Anomalies Over Composite Hypotheses. - Bar Hemo; Tomer Gafni; Kobi Cohen; Qing Zhao 001 (IEEE Trans. Signal Process., 2020)

An Order-Optimal Adaptive Test Plan for Noisy Group Testing Under Unknown Noise Models. - Sudeep Salgia; Qing Zhao 001 (ICASSP, 2021)

A Domain-Shrinking based Bayesian Optimization Algorithm with Order-Optimal Regret Performance. - Sudeep Salgia; Sattar Vakili; Qing Zhao 001 (NeurIPS, 2021)

As Easy as ABC: Adaptive Binning Coincidence Test for Uniformity Testing. - Sudeep Salgia; Qing Zhao 001; Lang Tong 001 (CoRR, 2021)

Searching for Unknown Anomalies in Hierarchical Data Streams. - Tomer Gafni; Kobi Cohen; Qing Zhao 001 (IEEE Signal Process. Lett., 2021)

Information-Directed Random Walk for Rare Event Detection in Hierarchical Processes. - Chao Wang 013; Kobi Cohen; Qing Zhao 001 (IEEE Trans. Inf. Theory, 2021)

Memory-Constrained No-Regret Learning in Adversarial Multi-Armed Bandits. - Xiao Xu; Qing Zhao 001 (IEEE Trans. Signal Process., 2021)

Provably and Practically Efficient Neural Contextual Bandits. - Sudeep Salgia; Sattar Vakili; Qing Zhao 001 (CoRR, 2022)

Kernel-based Federated Learning with Personalization. - Sudeep Salgia; Sattar Vakili; Qing Zhao 001 (CoRR, 2022)

Co-optimizing Distributed Energy Resources in Linear Complexity under Net Energy Metering. - Ahmed S. Alahmed; Lang Tong 001; Qing Zhao 001 (CoRR, 2022)

Novelty Detection in Time Series via Weak Innovations Representation: A Deep Learning Approach. - Xinyi Wang 006; Mei-jen Lee; Qing Zhao 001; Lang Tong 001 (CoRR, 2022)

Co-optimizing Consumption and EV Charging under Net Energy Metering. - Minjae Jeon; Lang Tong 001; Qing Zhao 001 (CoRR, 2022)

Disagreement-Based Active Learning in Online Settings. - Boshuang Huang; Sudeep Salgia; Qing Zhao 001 (IEEE Trans. Signal Process., 2022)

On the Optimality of Procrastination Policy for EV Charging Under Net Energy Metering. - Minjae Jeon; Lang Tong 001; Qing Zhao 001 (CDC, 2023)

Client Selection for Generalization in Accelerated Federated Learning: A Bandit Approach. - Dan Ben Ami; Kobi Cohen; Qing Zhao 001 (ICASSP, 2023)

Distributed Linear Bandits under Communication Constraints. - Sudeep Salgia; Qing Zhao 001 (ICML, 2023)

A Communication-Efficient Adaptive Algorithm for Federated Learning under Cumulative Regret. - Sudeep Salgia; Karthik Murthy; Qing Zhao 001; Tamir Gabay; Kobi Cohen (CoRR, 2023)

Non-parametric Probabilistic Time Series Forecasting via Innovations Representation. - Xinyi Wang 006; Mei-jen Lee; Qing Zhao 001; Lang Tong 001 (CoRR, 2023)

Collaborative Learning in Kernel-Based Bandits for Distributed Users. - Sudeep Salgia; Sattar Vakili; Qing Zhao 001 (IEEE Trans. Signal Process., 2023)

Generative Probabilistic Time Series Forecasting and Applications in Grid Operations. - Xinyi Wang 006; Lang Tong 001; Qing Zhao 001 (CISS, 2024)

Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiency. - Sudeep Salgia; Sattar Vakili; Qing Zhao 001 (ICML, 2024)

Anomaly Search of a Hidden Markov Model. - Levli Citron; Kobi Cohen; Qing Zhao 001 (ISIT, 2024)

Grid Monitoring and Protection with Continuous Point-on-Wave Measurements and Generative AI. - Lang Tong 001; Xinyi Wang 006; Qing Zhao 001 (CoRR, 2024)

A Communication-Efficient Adaptive Algorithm for Federated Learning Under Cumulative Regret. - Sudeep Salgia; Tamir Gabay; Qing Zhao 001; Kobi Cohen (IEEE Trans. Signal Process., 2024)

Adaptive Binning Coincidence Test for Uniformity Testing. - Sudeep Salgia; Xinyi Wang 006; Qing Zhao 001; Lang Tong 001 (IEEE Trans. Signal Process., 2024)

Differentially Private Kernelized Contextual Bandits. - Nikola Pavlovic; Sudeep Salgia; Qing Zhao 001 (AISTATS, 2025)

Order-Optimal Regret in Distributed Kernel Bandits using Uniform Sampling with Shared Randomness. - Nikola Pavlovic; Sudeep Salgia; Qing Zhao 001 (AISTATS, 2025)

Characterizing the Accuracy-Communication-Privacy Trade-off in Distributed Stochastic Convex Optimization. - Sudeep Salgia; Nikola Pavlovic; Yuejie Chi; Qing Zhao 001 (AISTATS, 2025)

Client Selection for Generalization in Accelerated Federated Learning: A Multi-Armed Bandit Approach. - Dan Ben Ami; Kobi Cohen; Qing Zhao 001 (IEEE Access, 2025)

Searching for a Hidden Markov Anomaly over Multiple Processes. - Levli Citron; Kobi Cohen; Qing Zhao 001 (CoRR, 2025)

Joint Scheduling of Deferrable and Nondeferrable Demand with Colocated Stochastic Supply. - Minjae Jeon; Lang Tong 001; Qing Zhao 001 (CoRR, 2025)

Differential Privacy in Kernelized Contextual Bandits via Random Projections. - Nikola Pavlovic; Sudeep Salgia; Qing Zhao 001 (CoRR, 2025)