9 citations · 12 across the 17 of their papers we have counts for
20 papers
Nearly Optimal Fixed-Confidence Best-Arm Identification with 1-Bit Feedback
Khang Luong, Dinh Thai Son, Hoang Ta +2
We study fixed-confidence best-arm identification under strict 1-bit feedback constraints. At each round, the learner selects an arm and a query set, and receives only a single bit…
Non-Adaptive Learning of Sparse Erdős--Rényi Graphs via Affine Splitting
Hoang Ta
Graph learning from edge-detecting queries concerns the reconstruction of an unknown edge set on a known vertex set. Each query reports whether a specified vertex subset contains a…
Graph-Based Stochastic Power-UCT: Monte-Carlo Graph Search with Power Mean Estimation
Tung Tran, Viet Bao Mai, Hoang Ta +1
Tree-based Monte-Carlo Tree Search (MCTS) duplicates the same state when it is reached through different trajectories, which can waste simulations in stochastic MDPs. We introduce…
A Sum-of-Squares Hierarchy with Quadratic Convergence for Quantum Channel Coding
Hoang Ta, Hoang Anh Tran
Computing the optimal success probability for transmitting classical messages through a single use of a quantum channel is NP-hard, even for two messages. An existing semidefinite…
Variance Driven Exploration: A Provable and Efficient Methodology for Pure Exploration in Highly Stochastic Environments
Khang Luong, Nam Nguyen, Hoang Ta +2
We propose Variance Driven Exploration (VarDE), a principled approach for pure exploration in highly stochastic environments, where the exploration process is dominated by stochast…
Near-Optimal Covering Sequences
Hoang Ta, Van Khu Vu
An -covering sequence over a finite alphabet is a cyclic sequence whose consecutive length- windows form a covering code of radius . Equival…
Block Tensor Rank of Sum-Rank Metric Codes
Huimin Lao, Huy Pham, Hoang Ta +1
Sum-rank codes provide a generalized framework for Hamming and rank-metric codes, with codewords represented as tuples of matrices and weight given by the sum of the block ranks. I…
Implementation and Optimization of HQC Decoding on NPU-Integrated Devices
Vu Minh Chau, Nguyen Ngoc Kiet, Pham Quang Minh +3
Hamming Quasi-Cyclic (HQC) has been selected by NIST for standardization as an additional code-based key-encapsulation mechanism, providing algorithmic diversity alongside lattice-…
ChaRVoC: A Challenge-Response Voice Cancelable Authentication System
Phuc-Khang Vo-Hoang, Hoang C. Ta, Nhien-An Le-Khac +2
In this work, we present a Challenge-Response Voice Cancelable authentication system, called ChaRVoC, which provides protection against replay attacks, revocability issues, and tem…
A Fast Hierarchical Splitting Approach for Non-Adaptive Learning of Random Hypergraphs
Huy Pham, Hoang Ta
This work focuses on the problem of learning an unknown -uniform hypergraph using edge-detecting queries. Our goal is to design a querying strategy that recovers the hyperedge s…
Nearly Optimal Bounds for Computing Decision Tree Splits in Data Streams
Hoang Ta, Hoa T. Vu
We establish nearly optimal upper and lower bounds for approximating decision tree splits in data streams. For regression with labels in the range , we give a one…
A Fast Binary Splitting Approach for Non-Adaptive Learning of Erdős--Rényi Graphs
Hoang Ta, Jonathan Scarlett
We study the problem of learning an unknown graph via group queries on node subsets, where each query reports whether at least one edge is present among the queried nodes. In gener…
On de Bruijn Covering Sequences and Arrays
Yeow Meng Chee, Tuvi Etzion, Hoang Ta +1
An -de Bruijn covering array (dBCA) is a doubly periodic array over an alphabet of size such that the set of all its windows form a covering…
Constructing Decision Trees from Data Streams
Huy Pham, Hoang Ta, Hoa T. Vu
In this work, we present data stream algorithms to compute optimal splits for decision tree learning. In particular, given a data stream of observations \(x_i\) and their correspon…
Optimizing Polynomial Graph Filters: A Novel Adaptive Krylov Subspace Approach
Keke Huang, Wencai Cao, Hoang Ta +2
Graph Neural Networks (GNNs), known as spectral graph filters, find a wide range of applications in web networks. To bypass eigendecomposition, polynomial graph filters are propose…
Efficient Approximation of Quantum Channel Fidelity Exploiting Symmetry
Yeow Meng Chee, Hoang Ta, Van Khu Vu
Determining the optimal fidelity for the transmission of quantum information over noisy quantum channels is one of the central problems in quantum information theory. Recently, [Be…
On the Asymptotic Nonnegative Rank of Matrices and its Applications in Information Theory
Yeow Meng Chee, Quoc Tung Le, Hoang Ta
In this paper, we study the asymptotic nonnegative rank of matrices, which characterizes the asymptotic growth of the nonnegative rank of fixed nonnegative matrices under the Krone…
A hierarchy of efficient bounds on quantum capacities exploiting symmetry
Omar Fawzi, Ala Shayeghi, Hoang Ta
Optimal rates for achieving an information processing task are often characterized in terms of regularized information measures. In many cases of quantum tasks, we do not know how…
Larger Corner-Free Sets from Combinatorial Degenerations
Matthias Christandl, Omar Fawzi, Hoang Ta +1
There is a large and important collection of Ramsey-type combinatorial problems, closely related to central problems in complexity theory, that can be formulated in terms of the as…
Symmetric Subrank of Tensors and Applications
Matthias Christandl, Omar Fawzi, Hoang Ta +1
Strassen (Strassen, J. Reine Angew. Math., 375/376, 1987) introduced the subrank of a tensor as a natural extension of matrix rank to tensors. Subrank measures the largest diagonal…