9 citations · 12 across the 17 of their papers we have counts for
11 papers · 1 filter
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…