← Search

Dzung Phan

4 accepted papers

2022

Interpretable Clustering via Multi-Polytope Machines

AAAI 2022technical

Clustering is a popular unsupervised learning tool often used to discover groups within a larger population such as customer segments, or patient subtypes. However, despite its use as a tool for subgroup discovery and description few state-of-the-art algorithms provide any rationale or description b…

Cited by 21SourcePDFScholar
2020

A Hybrid Stochastic Policy Gradient Algorithm for Reinforcement Learning

AISTATS 2020poster

We propose a novel hybrid stochastic policy gradient estimator by combining an unbiased policy gradient estimator, the REINFORCE estimator, with another biased one, an adapted SARAH estimator for policy optimization. The hybrid policy gradient estimator is shown to be biased, but has variance reduce…

2020

A Scalable MIP-based Method for Learning Optimal Multivariate Decision Trees

NeurIPS 2020poster

Several recent publications report advances in training optimal decision trees (ODTs) using mixed-integer programs (MIPs), due to algorithmic advances in integer programming and a growing interest in addressing the inherent suboptimality of heuristic approaches such as CART. In this paper, we propos…

Cited by 63SourcePDFScholar
2019

Characterization of Convex Objective Functions and Optimal Expected Convergence Rates for SGD

ICML 2019oral

We study Stochastic Gradient Descent (SGD) with diminishing step sizes for convex objective functions. We introduce a definitional framework and theory that defines and characterizes a core property, called curvature, of convex objective functions. In terms of curvature we can derive a new inequalit…

Cited by 7SourcePDFScholar