1 citations · 2 across the 3 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
math.OC2026
A Crawling Metric on the Space of Subtrees of a Tree
Thu-Le Tran, Cao Minh Quang, Nguyen Chi Tam +1
We propose a crawling metric on the space of subtrees of a tree. The symmetric difference cannot tell whether two disjoint subtrees are close or far; we halve it and add the gap be…
math.OC2026
On the Duality between Feature and Sample Screening
Thu-Le Tran
Feature and sample screening reduce the cost of machine learning by eliminating irrelevant features and noninformative samples, respectively. Although recognized as primal-dual cou…
cs.LG2026
Gap Safe Screening Rules for Fast Training of Robust Support Vector Machines under Feature Noise
Tan-Hau Nguyen, Thu-Le Tran, Kien Trung Nguyen
Robust Support Vector Machines (R-SVMs) address feature noise by adopting a worst-case robust formulation that explicitly incorporates uncertainty sets into training. While this ro…