research
∙
08/14/2023
Successive Refinement of Shannon Cipher System Under Maximal Leakage
We study the successive refinement setting of Shannon cipher system (SCS...
share
research
∙
01/19/2023
On Finite Blocklength Lossy Source Coding
In this monograph, we review recent advances in second-order asymptotics...
research
∙
10/24/2022
Efficient User Scheduling for Uplink Hybrid Satellite-Terrestrial Communication
Due to increasing demands of seamless connection and massive information...
research
∙
10/23/2022
Achievable Error Exponents for Almost Fixed-Length Hypothesis Testing and Classification
We revisit multiple hypothesis testing and propose a two-phase test, whe...
research
∙
10/12/2022
Efficient Image Super-Resolution using Vast-Receptive-Field Attention
The attention mechanism plays a pivotal role in designing advanced super...
research
∙
09/07/2022
Analyzing Population-Level Trials as N-of-1 Trials: an Application to Gait
Studying individual causal effects of health interventions is of interes...
research
∙
08/08/2022
Achievable Refined Asymptotics for Successive Refinement Using Gaussian Codebooks
We study the mismatched successive refinement problem where one uses Gau...
research
∙
06/14/2022
Resolution Limits of Non-Adaptive 20 Questions Search for a Moving Target
Using the 20 questions estimation framework with query-dependent noise, ...
research
∙
01/23/2022
Asymptotics for Outlier Hypothesis Testing
We revisit the outlier hypothesis testing framework of Li et al. (TIT 20...
research
∙
05/01/2021
Achievable Resolution Limits for the Noisy Adaptive 20 Questions Problem
We study the achievable performance of adaptive query procedures for the...
research
∙
03/15/2021
Resolution Limits of 20 Questions Search Strategies for Moving Targets
We establish fundamental limits of tracking a moving target over the uni...
research
∙
01/18/2021
Resolution Limits of Non-Adaptive 20 Questions Search for Multiple Targets
We study the problem of simultaneous search for multiple targets over a ...
research
∙
09/08/2020
Second-Order Asymptotically Optimal Universal Outlying Sequence Detection with Reject Option
Motivated by practical machine learning applications, we revisit the out...
research
∙
09/07/2020
Multiple Private Key Generation for Continuous Memoryless Sources with A Helper
We propose a method to study the secrecy constraints in key generation p...
research
∙
06/04/2020
Hypothesis Testing with Privacy Constraints Over A Noisy Channel
We consider a hypothesis testing problem with privacy constraints over a...
research
∙
06/04/2020
Strong Converse for Hypothesis Testing Against Independence Over A Noisy Channel
We revisit the hypothesis testing problem against independence over a no...
research
∙
04/15/2020
Resolution Limits of Non-Adaptive Querying for Noisy 20 Questions Estimation
We study fundamental limits of estimation accuracy for the noisy 20 ques...
research
∙
12/23/2019
Oriented Objects as pairs of Middle Lines
The detection of oriented objects is frequently appeared in the field of...
research
∙
09/27/2019
Resolution Limits of Noisy 20 Questions Estimation
We establish fundamental limits on estimation accuracy for the noisy 20 ...
research
∙
08/20/2019
GeoSQA: A Benchmark for Scenario-based Question Answering in the Geography Domain at High School Level
Scenario-based question answering (SQA) has attracted increasing researc...
research
∙
03/14/2019
Distributed Detection with Empirically Observed Statistics
We consider a binary distributed detection problem in which the distribu...
research
∙
01/05/2019
Exponential Strong Converse for Successive Refinement with Causal Decoder Side Information
We revisit the successive refinement problem with causal decoder side in...
research
∙
08/16/2018
Strong Converse for Hypothesis Testing Against Independence over a Two-Hop Network
By proving a strong converse, we strengthen the weak converse result by ...
research
∙
06/03/2018
Second-Order Asymptotically Optimal Statistical Classification
Motivated by real-world machine learning applications, we analyze approx...
research
∙
11/30/2017
