1 citations · 2 across the 3 of their papers we have counts for
5 papers
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…
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…
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…
One to beat them all: "RYU" -- a unifying framework for the construction of safe balls
Thu-Le Tran, Clément Elvira, Hong-Phuong Dang +1
In this paper, we present a new framework, called "RYU" for constructing "safe" regions -- specifically, bounded sets that are guaranteed to contain the dual solution of a target o…
Beyond GAP screening for Lasso by exploiting new dual cutting half-spaces with supplementary material
Thu-Le Tran, Clément Elvira, Hong-Phuong Dang +1
In this paper, we propose a novel safe screening test for Lasso. Our procedure is based on a safe region with a dome geometry and exploits a canonical representation of the set of…