Vincent Y. F. Tan

Orcid: 0000-0002-5008-4527

Affiliations:
  • National University of Singapore, Department of Electrical and Computer Engineering, Singapore


According to our database1, Vincent Y. F. Tan authored at least 293 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Corrections to "Equivocations, Exponents, and Second-Order Coding Rates Under Various Rényi Information Measures".
IEEE Trans. Inf. Theory, April, 2024

Multi-Armed Bandits with Abstention.
CoRR, 2024

Variable-Length Feedback Codes over Known and Unknown Channels with Non-vanishing Error Probabilities.
CoRR, 2024

Fixed-Budget Differentially Private Best Arm Identification.
CoRR, 2024

2023
Covert Communication With Mismatched Decoders.
IEEE Trans. Inf. Theory, July, 2023

Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu.
SIAM J. Comput., June, 2023

Fast Beam Alignment via Pure Exploration in Multi-Armed Bandits.
IEEE Trans. Wirel. Commun., May, 2023

Best Arm Identification in Restless Markov Multi-Armed Bandits.
IEEE Trans. Inf. Theory, May, 2023

Active-LATHE: An Active Learning Algorithm for Boosting the Error Exponent for Learning Homogeneous Ising Trees.
IEEE Trans. Inf. Theory, April, 2023

Almost Optimal Variance-Constrained Best Arm Identification.
IEEE Trans. Inf. Theory, April, 2023

Exact Recovery in the General Hypergraph Stochastic Block Model.
IEEE Trans. Inf. Theory, 2023

Asymptotic Nash Equilibrium for the M-Ary Sequential Adversarial Hypothesis Testing Game.
IEEE Trans. Inf. Forensics Secur., 2023

Towards Accurate Guided Diffusion Sampling through Symplectic Adjoint Method.
CoRR, 2023

Fixed-Budget Best-Arm Identification in Sparse Linear Bandits.
CoRR, 2023

Learning Regularized Graphon Mean-Field Games with Unknown Graphons.
CoRR, 2023

Optimal Best Arm Identification with Fixed Confidence in Restless Bandits.
CoRR, 2023

Optimal Private Discrete Distribution Estimation with One-bit Communication.
CoRR, 2023

AdjointDPM: Adjoint Sensitivity Method for Gradient Backpropagation of Diffusion Probabilistic Models.
CoRR, 2023

DragDiffusion: Harnessing Diffusion Models for Interactive Point-based Image Editing.
CoRR, 2023

Codes for Correcting Asymmetric Adjacent Transpositions and Deletions.
CoRR, 2023

Learning Regularized Monotone Graphon Mean-Field Games.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Deep Unrolling for Nonconvex Robust Principal Component Analysis.
Proceedings of the 33rd IEEE International Workshop on Machine Learning for Signal Processing, 2023

Codes for Correcting t Limited-Magnitude Sticky Deletions.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Communication-Constrained Bandits under Additive Gaussian Noise.
Proceedings of the International Conference on Machine Learning, 2023

Probably Anytime-Safe Stochastic Combinatorial Semi-Bandits.
Proceedings of the International Conference on Machine Learning, 2023

Towards Understanding and Mitigating Dimensional Collapse in Heterogeneous Federated Learning.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Minimizing the Accumulated Trajectory Error to Improve Dataset Distillation.
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2023

Blink: Link Local Differential Privacy in Graph Neural Networks via Bayesian Estimation.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

How Does Pseudo-Labeling Affect the Generalization Error of the Semi-Supervised Gibbs Algorithm?
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

Almost Cost-Free Communication in Federated Best Arm Identification.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Mc2g: An Efficient Algorithm for Matrix Completion With Social and Item Similarity Graphs.
IEEE Trans. Signal Process., 2022

Tight Regret Bounds for Noisy Optimization of a Brownian Motion.
IEEE Trans. Signal Process., 2022

On Smooth Rényi Entropies: A Novel Information Measure, One-Shot Coding Theorems, and Asymptotic Expansions.
IEEE Trans. Inf. Theory, 2022

Asymptotics of Sequential Composite Hypothesis Testing Under Probabilistic Constraints.
IEEE Trans. Inf. Theory, 2022

Distributionally Robust and Multi-Objective Nonnegative Matrix Factorization.
IEEE Trans. Pattern Anal. Mach. Intell., 2022

Information-Theoretic Characterization of the Generalization Error for Iterative Semi-Supervised Learning.
J. Mach. Learn. Res., 2022

Common Information, Noise Stability, and Their Extensions.
Found. Trends Commun. Inf. Theory, 2022

Federated Best Arm Identification with Heterogeneous Clients.
CoRR, 2022

Optimal Clustering with Bandit Feedback.
CoRR, 2022

Relational Reasoning via Set Transformers: Provable Efficiency and Applications to MARL.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Minimax Optimal Fixed-Budget Best Arm Identification in Linear Bandits.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Sharpness-Aware Training for Free.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Codes for the Asymmetric Damerau-Levenshtein Distance.
Proceedings of the IEEE Information Theory Workshop, 2022

Best Restless Markov Arm Identification.
Proceedings of the IEEE Information Theory Workshop, 2022

Fast Beam Alignment via Pure Exploration in Multi-armed Bandits.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Asymptotic Nash Equilibrium for the Sequential Adversarial Hypothesis Testing Game.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Towards Adversarially Robust Deep Image Denoising.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

A Survey of Risk-Aware Multi-Armed Bandits.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Efficient Sharpness-aware Minimization for Improved Training of Neural Networks.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Mimicking the Oracle: An Initial Phase Decorrelation Approach for Class Incremental Learning.
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2022

A Unifying Theory of Thompson Sampling for Continuous Risk-Averse Bandits.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Community Detection and Matrix Completion With Social and Item Similarity Graphs.
IEEE Trans. Signal Process., 2021

Positive Semidefinite Matrix Factorization: A Connection With Phase Retrieval and Affine Rank Minimization.
IEEE Trans. Signal Process., 2021

Covert Identification Over Binary-Input Discrete Memoryless Channels.
IEEE Trans. Inf. Theory, 2021

On Non-Interactive Simulation of Binary Random Variables.
IEEE Trans. Inf. Theory, 2021

State Masking Over a Two-State Compound Channel.
IEEE Trans. Inf. Theory, 2021

Third-Order Asymptotics of Variable-Length Compression Allowing Errors.
IEEE Trans. Inf. Theory, 2021

On the Capacity of Channels With Deletions and States.
IEEE Trans. Inf. Theory, 2021

Optimal Change-Point Detection With Training Sequences in the Large and Moderate Deviations Regimes.
IEEE Trans. Inf. Theory, 2021

Sequential Classification With Empirically Observed Statistics.
IEEE Trans. Inf. Theory, 2021

Adversarially-Trained Nonnegative Matrix Factorization.
IEEE Signal Process. Lett., 2021

Editorial.
IEEE J. Sel. Areas Inf. Theory, 2021

Analysis of Optimization Algorithms via Sum-of-Squares.
J. Optim. Theory Appl., 2021

Thompson Sampling Algorithms for Cascading Bandits.
J. Mach. Learn. Res., 2021

On the Pareto Frontier of Regret Minimization and Best Arm Identification in Stochastic Bandits.
CoRR, 2021

Information-Theoretic Generalization Bounds for Iterative Semi-Supervised Learning.
CoRR, 2021

Towards Minimax Optimal Best Arm Identification in Linear Bandits.
CoRR, 2021

SGA: A Robust Algorithm for Partial Recovery of Tree-Structured Graphical Models with Noisy Samples.
CoRR, 2021

Robustifying Algorithms of Learning Latent Trees with Vector Variables.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Distributed Sequential Hypothesis Testing With Zero-Rate Compression.
Proceedings of the IEEE Information Theory Workshop, 2021

Optimal Adaptive Strategies for Sequential Quantum Hypothesis Testing.
Proceedings of the IEEE Information Theory Workshop, 2021

On the Feed-Forward Rate-Distortion Function for Stationary and Ergodic Sources.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Probabilistic Sequential Shrinking: A Best Arm Identification Algorithm for Stochastic Bandits with Corruptions.
Proceedings of the 38th International Conference on Machine Learning, 2021

CIFS: Improving Adversarial Robustness of CNNs via Channel-wise Importance-based Feature Selection.
Proceedings of the 38th International Conference on Machine Learning, 2021

SGA: A Robust Algorithm for Partial Recovery of Tree-Structured Graphical Models with Noisy Samples.
Proceedings of the 38th International Conference on Machine Learning, 2021

An Interpretable Intensive Care Unit Mortality Risk Calculator.
Proceedings of the 43rd Annual International Conference of the IEEE Engineering in Medicine & Biology Society, 2021

2020
On Exact and ∞-Rényi Common Informations.
IEEE Trans. Inf. Theory, 2020

Exact Channel Synthesis.
IEEE Trans. Inf. Theory, 2020

Corrections to "Wyner's Common Information Under Rényi Divergence Measures".
IEEE Trans. Inf. Theory, 2020

The Bee-Identification Error Exponent With Absentee Bees.
IEEE Trans. Inf. Theory, 2020

Variable-Length Source Dispersions Differ Under Maximum and Average Error Criteria.
IEEE Trans. Inf. Theory, 2020

Second- and Third-Order Asymptotics of the Continuous-Time Poisson Channel.
IEEE Trans. Inf. Theory, 2020

Second-Order Asymptotics of Sequential Hypothesis Testing.
IEEE Trans. Inf. Theory, 2020

Distributed Detection With Empirically Observed Statistics.
IEEE Trans. Inf. Theory, 2020

Throughput Scaling of Covert Communication Over Wireless Adhoc Networks.
IEEE Trans. Inf. Theory, 2020

Exact Error and Erasure Exponents for the Asymmetric Broadcast Channel.
IEEE Trans. Inf. Theory, 2020

Exact Asymptotics for Learning Tree-Structured Graphical Models With Side Information: Noiseless and Noisy Samples.
IEEE J. Sel. Areas Inf. Theory, 2020

Risk-Constrained Thompson Sampling for CVaR Bandits.
CoRR, 2020

Covert Identification over Binary-Input Memoryless Channels.
CoRR, 2020

Asymptotic Expansions of Smooth Rényi Entropies and Their Applications.
CoRR, 2020

Third-Order Asymptotics of Variable-Length Compression Allowing Errors.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020

Optimal Resolution of Change-Point Detection with Empirically Observed Statistics and Erasures.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020

Achievability Bounds for Community Detection and Matrix Completion with Two-Sided Graph Side-Information.
Proceedings of the IEEE International Symposium on Information Theory, 2020

On the Second- and Third-Order Asymptotics of Smooth Rényi Entropy and Their Applications.
Proceedings of the IEEE International Symposium on Information Theory, 2020

On the Error Exponent of Approximate Sufficient Statistics for M-ary Hypothesis Testing.
Proceedings of the IEEE International Symposium on Information Theory, 2020

On the Capacity of Deletion Channels with States.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Thompson Sampling Algorithms for Mean-Variance Bandits.
Proceedings of the 37th International Conference on Machine Learning, 2020

Best Arm Identification for Cascading Bandits in the Fixed Confidence Setting.
Proceedings of the 37th International Conference on Machine Learning, 2020

On Robustness of Neural Ordinary Differential Equations.
Proceedings of the 8th International Conference on Learning Representations, 2020

Economy Statistical Recurrent Units For Inferring Nonlinear Granger Causality.
Proceedings of the 8th International Conference on Learning Representations, 2020

2019
Refined Asymptotics for Rate-Distortion Using Gaussian Codebooks for Arbitrary Sources.
IEEE Trans. Inf. Theory, 2019

The Dispersion of Mismatched Joint Source-Channel Coding for Arbitrary Sources and Additive Channels.
IEEE Trans. Inf. Theory, 2019

Simulation of Random Variables Under Rényi Divergence Measures of All Orders.
IEEE Trans. Inf. Theory, 2019

Rényi Resolvability and Its Applications to the Wiretap Channel.
IEEE Trans. Inf. Theory, 2019

Asymptotic Coupling and Its Applications in Information Theory.
IEEE Trans. Inf. Theory, 2019

The Reliability Function of Variable-Length Lossy Joint Source-Channel Coding With Feedback.
IEEE Trans. Inf. Theory, 2019

Moderate Deviation Asymptotics for Variable-Length Codes With Feedback.
IEEE Trans. Inf. Theory, 2019

The Informativeness of k-Means for Learning Mixture Models.
IEEE Trans. Inf. Theory, 2019

On the Maximum Size of Block Codes Subject to a Distance Criterion.
IEEE Trans. Inf. Theory, 2019

Time-Division is Optimal for Covert Communication Over Some Broadcast Channels.
IEEE Trans. Inf. Forensics Secur., 2019

On the Throughput of Channels That Wear Out.
IEEE Trans. Commun., 2019

The Bee-Identification Problem: Bounds on the Error Exponent.
IEEE Trans. Commun., 2019

Fundamental Limits of Communication Over State-Dependent Channels With Feedback.
IEEE Trans. Commun., 2019

Strong Converse Theorems for Multimessage Networks with Tight Cut-Set Bound.
Probl. Inf. Transm., 2019

Mobile Gait Analysis Using Foot-Mounted UWB Sensors.
Proc. ACM Interact. Mob. Wearable Ubiquitous Technol., 2019

Distributed Hypothesis Testing with Privacy Constraints.
Entropy, 2019

A Strong Converse Theorem for Hypothesis Testing Against Independence over a Two-Hop Network.
Entropy, 2019

Community Detection and Matrix Completion with Two-Sided Graph Side-Information.
CoRR, 2019

An Improved Linear Programming Bound on the Average Distance of a Binary Code.
CoRR, 2019

Covert Communication Over a Compound Channel.
CoRR, 2019

Unsupervised Image Noise Modeling with Self-Consistent GAN.
CoRR, 2019

Error Exponent Bounds for the Bee-Identification Problem.
CoRR, 2019

Bounds on the Average Distance and Distance Enumerator with Applications to Non-Interactive Simulation.
CoRR, 2019

A Ranking Model Motivated by Nonnegative Matrix Factorization with Applications to Tennis Tournaments.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2019

Random Coding Error Exponent for the Bee-Identification Problem.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Second-Order Asymptotics of the Continuous-Time Poisson Channel.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Strong Converse for Hypothesis Testing Against Independence over a Two-Hop Network.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Covert Communication Over a Compound Discrete Memoryless Channel.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Second-Order Asymptotically Optimal Statistical Classification.
Proceedings of the IEEE International Symposium on Information Theory, 2019

An Optimal Algorithm for Stochastic Three-Composite Optimization.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

A Thompson Sampling Algorithm for Cascading Bandits.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
A Unified Convergence Analysis of the Multiplicative Update Algorithm for Regularized Nonnegative Matrix Factorization.
IEEE Trans. Signal Process., 2018

Stochastic L-BFGS: Improved Convergence Rates and Practical Acceleration Strategies.
IEEE Trans. Signal Process., 2018

Exponential Strong Converse for Content Identification With Lossy Recovery.
IEEE Trans. Inf. Theory, 2018

Achievable Moderate Deviations Asymptotics for Streaming Compression of Correlated Sources.
IEEE Trans. Inf. Theory, 2018

Wyner's Common Information Under Rényi Divergence Measures.
IEEE Trans. Inf. Theory, 2018

On Gaussian MACs With Variable-Length Feedback and Non-Vanishing Error Probabilities.
IEEE Trans. Inf. Theory, 2018

Analysis of Remaining Uncertainties and Exponents Under Various Conditional Rényi Entropies.
IEEE Trans. Inf. Theory, 2018

Codes in the Space of Multisets - Coding for Permutation Channels With Impairments.
IEEE Trans. Inf. Theory, 2018

Minimum Rates of Approximate Sufficient Statistics.
IEEE Trans. Inf. Theory, 2018

On Achievable Rates of AWGN Energy-Harvesting Channels With Block Energy Arrival and Non-Vanishing Error Probabilities.
IEEE Trans. Inf. Theory, 2018

Hypothesis Testing Under Mutual Information Privacy Constraints in the High Privacy Regime.
IEEE Trans. Inf. Forensics Secur., 2018

Introduction to the Issue on Information-Theoretic Methods in Data Acquisition, Analysis, and Processing.
IEEE J. Sel. Top. Signal Process., 2018

Lower Bounds on the Bayes Risk of the Bayesian BTL Model With Applications to Comparison Graphs.
IEEE J. Sel. Top. Signal Process., 2018

Asymptotically Optimal Codes Correcting Fixed-Length Duplication Errors in DNA Storage Systems.
IEEE Commun. Lett., 2018

Thompson Sampling for Cascading Bandits.
CoRR, 2018

The Optimal Compression Rate of Variable-to-Fixed Length Source Coding with a Non-Vanishing Excess-Distortion Probability.
CoRR, 2018

Minimax Lower Bounds for Nonnegative Matrix Factorization.
Proceedings of the 2018 IEEE Statistical Signal Processing Workshop, 2018

Inference Algorithms for the Multiplicative Mixture Mallows Model.
Proceedings of the 2018 International Conference on Signal Processing and Communications (SPCOM), 2018

Error-Free Communication Over State-Dependent Channels with Variable-Length Feedback.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

The Reliability Function of Lossy Source-Channel Coding of Variable-Length Codes with Feedback.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Second-Order Asymptotics of Universal JSCC for Arbitrary Sources and Additive Channels.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Second-Order Asymptotics of Rate-Distortion using Gaussian Codebooks for Arbitrary Sources.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Applications of an exact formula for the largest minimum distance of block codes.
Proceedings of the 52nd Annual Conference on Information Sciences and Systems, 2018

MANA: Designing and Validating a User-Centered Mobility Analysis System.
Proceedings of the 20th International ACM SIGACCESS Conference on Computers and Accessibility, 2018

2017
Online Nonnegative Matrix Factorization With Outliers.
IEEE Trans. Signal Process., 2017

Rank-One NMF-Based Initialization for NMF and Relative Error Bounds Under a Geometric Assumption.
IEEE Trans. Signal Process., 2017

Second-Order and Moderate Deviations Asymptotics for Successive Refinement.
IEEE Trans. Inf. Theory, 2017

Discrete Lossy Gray-Wyner Revisited: Second-Order Asymptotics, Large and Moderate Deviations.
IEEE Trans. Inf. Theory, 2017

On Gaussian Channels With Feedback Under Expected Power Constraints and With Non-Vanishing Error Probabilities.
IEEE Trans. Inf. Theory, 2017

Adversarial Top-K Ranking.
IEEE Trans. Inf. Theory, 2017

The Dispersion of Nearest-Neighbor Decoding for Additive Non-Gaussian Channels.
IEEE Trans. Inf. Theory, 2017

Exact Moderate Deviation Asymptotics in Streaming Data Transmission.
IEEE Trans. Inf. Theory, 2017

Zero-Error Capacity of P-ary Shift Channels and FIFO Queues.
IEEE Trans. Inf. Theory, 2017

Equivocations, Exponents, and Second-Order Coding Rates Under Various Rényi Information Measures.
IEEE Trans. Inf. Theory, 2017

A Proof of the Strong Converse Theorem for Gaussian Broadcast Channels via the Gaussian Poincaré Inequality.
IEEE Trans. Inf. Theory, 2017

A Tight Upper Bound on the Second-Order Coding Rate of the Parallel Gaussian Channel With Feedback.
IEEE Trans. Inf. Theory, 2017

Achievable Rates for Gaussian Degraded Relay Channels With Non-Vanishing Error Probabilities.
IEEE Trans. Inf. Theory, 2017

Improved Bounds on Sidon Sets via Lattice Packings of Simplices.
SIAM J. Discret. Math., 2017

Polar Coding for the Binary Erasure Channel With Deletions.
IEEE Commun. Lett., 2017

Scaling Exponent and Moderate Deviations Asymptotics of Polar Codes for the AWGN Channel.
Entropy, 2017

The Dispersion of Universal Joint Source-Channel Coding for Arbitrary Sources and Additive Channels.
CoRR, 2017

Time-Division Transmission is Optimal for Covert Communication over Broadcast Channels.
CoRR, 2017

Lower Bounds on the Bayes Risk of the Bayesian BTL Model with Applications to Random Graphs.
CoRR, 2017

Exponential Strong Converse for Content Identification with Lossy Recovery.
CoRR, 2017

On the Reliability Function of the Common-Message Broadcast Channel with Variable-Length Feedback.
CoRR, 2017

The Informativeness of k-Means for Learning Gaussian Mixture Models.
CoRR, 2017

An Exact Spectrum Formula for the Maximum Size of Finite Length Block Codes.
CoRR, 2017

Stochastic L-BFGS Revisited: Improved Convergence Rates and Practical Acceleration Strategies.
Proceedings of the Thirty-Third Conference on Uncertainty in Artificial Intelligence, 2017

Delay scaling laws of random wireless networks: Impact of blocklength.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Error exponent for covert communications over discrete memoryless channels.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

A tight upper bound on the second-order coding rate of parallel Gaussian channels with feedback.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Distance spectrum formula for the largest minimum hamming distance of finite-length binary block codes.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

On the Gaussian MAC with degraded message sets and long-term power constraints.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Robust decoding schemes for polar coding over compound channels.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Achievable moderate deviations asymptotics for streaming Slepian-Wolf coding.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Strong converse for content identification with lossy recovery.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Communication over a channel that wears out.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

On the Gaussian MAC with stop-feedback.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Error exponent of the common-message broadcast channel with variable-length feedback.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Hypothesis testing under maximal leakage privacy constraints.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Strong converse theorems for discrete memoryless networks with tight cut-set bound.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Moderate deviation analysis for classical communication over quantum channels.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Coding for the permutation channel with insertions, deletions, substitutions, and erasures.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

A unified convergence analysis of the multiplicative update algorithm for nonnegative matrix factorization.
Proceedings of the 2017 IEEE International Conference on Acoustics, 2017

Relative error bounds for nonnegative matrix factorization under a geometric assumption.
Proceedings of the 2017 IEEE International Conference on Acoustics, 2017

Online Nonnegative Matrix Factorization with General Divergences.
Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017

2016
Streaming Data Transmission in the Moderate Deviations and Central Limit Regimes.
IEEE Trans. Inf. Theory, 2016

Strong Converse Theorems for Classes of Multimessage Multicast Networks: A Rényi Divergence Approach.
IEEE Trans. Inf. Theory, 2016

A Proof of the Strong Converse Theorem for Gaussian Multiple Access Channels.
IEEE Trans. Inf. Theory, 2016

A Numerical Study on the Wiretap Network With a Simple Network Topology.
IEEE Trans. Inf. Theory, 2016

Non-Asymptotic Achievable Rates for Energy-Harvesting Channels Using Save-and-Transmit.
IEEE J. Sel. Areas Commun., 2016

On the Scaling Exponent of Polar Codes for Binary-Input Energy-Harvesting Channels.
IEEE J. Sel. Areas Commun., 2016

Moderate Deviations Asymptotics for Streaming Compression of Correlated Sources.
CoRR, 2016

Second-Order and Moderate Deviation Asymptotics for Successive Refinement.
CoRR, 2016

On AWGN Channels and Gaussian MACs with Variable-Length Feedback.
CoRR, 2016

Sidon Sets of Fixed Cardinality and Lattice-Packings of Simplices.
CoRR, 2016

Zero-Error Shift-Correcting and Shift-Detecting Codes.
CoRR, 2016

Strong Converse for Discrete Memoryless Networks with Tight Cut-Set Bounds.
CoRR, 2016

Second-order coding region for the discrete successive refinement source coding problem.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Second-order coding region for the discrete lossy Gray-Wyner source coding problem.
Proceedings of the IEEE International Symposium on Information Theory, 2016

On second-order asymptotics of AWGN channels with feedback under the expected power constraint.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Remaining uncertainties and exponents under Rényi information measures.
Proceedings of the IEEE International Symposium on Information Theory, 2016

A non-asymptotic achievable rate for the AWGN energy-harvesting channel using save-and-transmit.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Hypothesis testing in the high privacy limit.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015
Nonasymptotic and Second-Order Achievability Bounds for Coding With Side-Information.
IEEE Trans. Inf. Theory, 2015

The Third-Order Term in the Normal Approximation for the AWGN Channel.
IEEE Trans. Inf. Theory, 2015

On the Reliability Function of the Discrete Memoryless Relay Channel.
IEEE Trans. Inf. Theory, 2015

Unequal Message Protection: Asymptotic and Non-Asymptotic Tradeoffs.
IEEE Trans. Inf. Theory, 2015

Second-Order Asymptotics for the Gaussian MAC With Degraded Message Sets.
IEEE Trans. Inf. Theory, 2015

A Case Where Interference Does Not Affect the Channel Dispersion.
IEEE Trans. Inf. Theory, 2015

Asymmetric Evaluations of Erasure and Undetected Error Probabilities.
IEEE Trans. Inf. Theory, 2015

The Sender-Excited Secret Key Agreement Model: Capacity, Reliability, and Secrecy Exponents.
IEEE Trans. Inf. Theory, 2015

Information Spectrum Approach to Strong Converse Theorems for Degraded Wiretap Channels.
IEEE Trans. Inf. Forensics Secur., 2015

Error and Erasure Exponents for the Broadcast Channel with Degraded Message Sets.
CoRR, 2015

Error and erasure exponents for the asymmetric broadcast channel.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Second-order asymptotics for the discrete memoryless MAC with degraded message sets.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Erasure and undetected error probabilities in the moderate deviations regime.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Equivocations and exponents under various Rényi information measures.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Asymptotic expansions for the AWGN channel with feedback under a peak power constraint.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Second-order coding rate for m-class source-channel codes.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014
A Parsimonious Mixture of Gaussian Trees Model for Oversampling in Imbalanced and Multimodal Time-Series Classification.
IEEE Trans. Neural Networks Learn. Syst., 2014

Second-Order Coding Rates for Channels With State.
IEEE Trans. Inf. Theory, 2014

On the Dispersions of Three Network Information Theory Problems.
IEEE Trans. Inf. Theory, 2014

A Formula for the Capacity of the General Gel'fand-Pinsker Channel.
IEEE Trans. Commun., 2014

Strong Impossibility Results for Sparse Signal Processing.
IEEE Signal Process. Lett., 2014

Asymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities.
Found. Trends Commun. Inf. Theory, 2014

Second- and Higher-Order Asymptotics For Erasure and List Decoding.
CoRR, 2014

Second-Order Coding Rates for Conditional Rate-Distortion.
CoRR, 2014

Asymptotic Expansions for Gaussian Channels with Feedback under a Peak Power Constraint.
CoRR, 2014

Second order refinements for the classical capacity of quantum channels with separable input states.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Moderate deviations for joint source-channel coding of systems with Markovian memory.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Second-order capacities of erasure and list decoding.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Achievability bounds for unequal message protection at finite block lengths.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

On mismatched unequal message protection for finite block length joint source-channel coding.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Second-order asymptotics for the Gaussian interference channel with strictly very strong interference.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Strong impossibility results for noisy group testing.
Proceedings of the IEEE International Conference on Acoustics, 2014

2013
Wireless Compressive Sensing for Energy Harvesting Sensor Nodes.
IEEE Trans. Signal Process., 2013

A Tight Upper Bound for the Third-Order Asymptotics for Most Discrete Memoryless Channels.
IEEE Trans. Inf. Theory, 2013

Automatic Relevance Determination in Nonnegative Matrix Factorization with the $(\beta)$-Divergence.
IEEE Trans. Pattern Anal. Mach. Intell., 2013

ε-Capacities and Second-Order Coding Rates for Channels with General State
CoRR, 2013

Non-Asymptotic and Second-Order Achievability Bounds for Coding With Side-Information
CoRR, 2013

Second-Order Asymptotics of Classical-Quantum Channels.
CoRR, 2013

MOGT: Oversampling with a parsimonious mixture of Gaussian trees model for imbalanced time-series classification.
Proceedings of the IEEE International Workshop on Machine Learning for Signal Processing, 2013

ε-Capacity and strong converse for channels with general state.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Non-asymptotic and second-order achievability bounds for source coding with side-information.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

A tight upper bound for the third-order asymptotics of discrete memoryless channels.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Error exponents for the relay channel.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Converse bounds for assorted codes in the finite blocklength regime.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

On the dispersions of the discrete memoryless interference channel.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Wireless compressive sensing for energy harvesting sensor nodes over fading channels.
Proceedings of IEEE International Conference on Communications, 2013

2012
Rank Minimization Over Finite Fields: Fundamental Limits and Coding-Theoretic Interpretations.
IEEE Trans. Inf. Theory, 2012

High-dimensional Gaussian graphical model selection: walk summability and local separation criterion.
J. Mach. Learn. Res., 2012

The Capacity of the General Gel'fand-Pinsker Channel and Achievable Second-Order Coding Rates
CoRR, 2012

The dispersion of Slepian-Wolf coding.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Moderate-deviations of lossy source coding for discrete and Gaussian sources.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Achievable second-order coding rates for the wiretap channel.
Proceedings of the IEEE International Conference on Communication Systems, 2012

Transmission of correlated sources over a MAC: A Gaussian approximation-based analysis.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011
Large-deviation analysis and applications Of learning tree-structured graphical models.
PhD thesis, 2011

A Large-Deviation Analysis of the Maximum-Likelihood Learning of Markov Tree Structures.
IEEE Trans. Inf. Theory, 2011

Learning High-Dimensional Markov Forest Distributions: Analysis of Error Rates.
J. Mach. Learn. Res., 2011

Learning Latent Tree Graphical Models.
J. Mach. Learn. Res., 2011

The Sender-Excited Secret Key Agreement Model: Capacity and Error Exponents
CoRR, 2011

High-Dimensional Structure Estimation in Ising Models: Tractable Graph Families
CoRR, 2011

High-Dimensional Gaussian Graphical Model Selection: Tractable Graph Families
CoRR, 2011

High-Dimensional Graphical Model Selection: Tractable Graph Families and Necessary Conditions.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

Rank minimization over finite fields.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Sample complexity for topology estimation in networks of LTI systems.
Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, 2011

Canonical estimation in a rare-events regime.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

The sender-excited secret key agreement model: Capacity theorems.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
Learning graphical models for hypothesis testing and classification.
IEEE Trans. Signal Process., 2010

Learning Gaussian tree models: analysis of error exponents and extremal structures.
IEEE Trans. Signal Process., 2010

Necessary and sufficient conditions for high-dimensional salient feature subset recovery.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Error exponents for composite hypothesis testing of Markov forest distributions.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Scaling laws for learning high-dimensional Markov forest distributions.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010

Consistent and efficient reconstruction of latent tree models.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009
A large-deviation analysis for the maximum likelihood learning of tree structures.
Proceedings of the IEEE International Symposium on Information Theory, 2009

How do the structure and the parameters of Gaussian tree models affect structure learning?
Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008
Estimating Signals With Finite Rate of Innovation From Noisy Samples: A Stochastic Algorithm.
IEEE Trans. Signal Process., 2008

Learning max-weight discriminative forests.
Proceedings of the IEEE International Conference on Acoustics, 2008

Immune System Modeling with Infer.NET.
Proceedings of the Fourth International Conference on e-Science, 2008

2007
Generic Probability Density Function Reconstruction for Randomization in Privacy-Preserving Data Mining.
Proceedings of the Machine Learning and Data Mining in Pattern Recognition, 2007

Privacy-Preserving Sharing of Horizontally-Distributed Private Data for Constructing Accurate Classifiers.
Proceedings of the Privacy, 2007


  Loading...