activity
20162024
most citedAlgorithms for Nonnegative Matrix Factorization with the Kullback-Leibler Divergence

48 citations · 119 across the 16 of their papers we have counts for

collaborators

16 papers

cs.LG2024★ 2 cited

Block Majorization Minimization with Extrapolation and Application to -NMF

Le Thi Khanh Hien, Valentin Leplat, Nicolas Gillis

We propose a Block Majorization Minimization method with Extrapolation (BMMe) for solving a class of multi-convex optimization problems. The extrapolation parameters of BMMe are up…

cs.LG2023★ 7 cited

Deep Nonnegative Matrix Factorization with Beta Divergences

Valentin Leplat, Le Thi Khanh Hien, Akwum Onwunta +1

Deep Nonnegative Matrix Factorization (deep NMF) has recently emerged as a valuable technique for extracting multiple layers of features across different scales. However, all exist…

cs.LG2023

Anomaly detection with semi-supervised classification based on risk estimators

Le Thi Khanh Hien, Sukanya Patra, Souhaib Ben Taieb

A significant limitation of one-class classification anomaly detection methods is their reliance on the assumption that unlabeled training data only contains normal instances. To o…

math.OC2022

An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints

Le Thi Khanh Hien, Dimitri Papadimitriou

In this paper, we propose an inertial alternating direction method of multipliers for solving a class of non-convex multi-block optimization problems with \emph{nonlinear coupling…

math.OC2022

Multiblock ADMM for nonsmooth nonconvex optimization with nonlinear coupling constraints

Le Thi Khanh Hien, Dimitri Papadimitriou

This paper proposes a multiblock alternating direction method of multipliers for solving a class of multiblock nonsmooth nonconvex optimization problem with nonlinear coupling cons…

math.OC2021★ 13 cited

Block Alternating Bregman Majorization Minimization with Extrapolation

Le Thi Khanh Hien, Duy Nhat Phan, Nicolas Gillis +2

In this paper, we consider a class of nonsmooth nonconvex optimization problems whose objective is the sum of a block relative smooth function and a proper and lower semicontinuous…

math.OC2021★ 23 cited

A Framework of Inertial Alternating Direction Method of Multipliers for Non-Convex Non-Smooth Optimization

Le Thi Khanh Hien, Duy Nhat Phan, Nicolas Gillis

In this paper, we propose an algorithmic framework, dubbed inertial alternating direction methods of multipliers (iADMM), for solving a class of nonconvex nonsmooth multiblock comp…

math.OC2020★ 7 cited

An Inertial Block Majorization Minimization Framework for Nonsmooth Nonconvex Optimization

Le Thi Khanh Hien, Duy Nhat Phan, Nicolas Gillis

In this paper, we introduce TITAN, a novel inerTIal block majorizaTion minimizAtioN framework for non-smooth non-convex optimization problems. To the best of our knowledge, TITAN i…

math.OC2020★ 48 cited

Algorithms for Nonnegative Matrix Factorization with the Kullback-Leibler Divergence

Le Thi Khanh Hien, Nicolas Gillis

Nonnegative matrix factorization (NMF) is a standard linear dimensionality reduction technique for nonnegative data sets. In order to measure the discrepancy between the input data…

math.OC2020

A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization

Masoud Ahookhosh, Le Thi Khanh Hien, Nicolas Gillis +1

We propose BIBPA, a block inertial Bregman proximal algorithm for minimizing the sum of a block relatively smooth function (that is, relatively smooth concerning each block) and bl…

math.OC2019★ 10 cited

Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization

Masoud Ahookhosh, Le Thi Khanh Hien, Nicolas Gillis +1

We introduce and analyze BPALM and A-BPALM, two multi-block proximal alternating linearized minimization algorithms using Bregman distances for solving structured nonconvex problem…

math.OC2019★ 3 cited

Inertial Block Proximal Methods for Non-Convex Non-Smooth Optimization

Le Thi Khanh Hien, Nicolas Gillis, Panagiotis Patrinos

We propose inertial versions of block coordinate descent methods for solving non-convex non-smooth composite optimization problems. Our methods possess three main advantages compar…

cs.LG2019★ 4 cited

Distributionally Robust and Multi-Objective Nonnegative Matrix Factorization

Nicolas Gillis, Le Thi Khanh Hien, Valentin Leplat +1

Nonnegative matrix factorization (NMF) is a linear dimensionality reduction technique for analyzing nonnegative data. A key aspect of NMF is the choice of the objective function th…

math.OC2018

A global linear and local superlinear/quadratic inexact non-interior continuation method for variational inequalities

Le Thi Khanh Hien, Chek Beng Chua

We use the concept of barrier-based smoothing approximations introduced in [ C. B. Chua and Z. Li, A barrier-based smoothing proximal point algorithm for NCPs over closed convex co…

math.OC2017★ 2 cited

An Inexact Primal-Dual Smoothing Framework for Large-Scale Non-Bilinear Saddle Point Problems

Le Thi Khanh Hien, Renbo Zhao, William B. Haskell

We develop an inexact primal-dual first-order smoothing framework to solve a class of non-bilinear saddle point problems with primal strong convexity. Compared with existing method…

math.OC2016

Accelerated Randomized Mirror Descent Algorithms For Composite Non-strongly Convex Optimization

Le Thi Khanh Hien, Cuong V. Nguyen, Huan Xu +2

We consider the problem of minimizing the sum of an average function of a large number of smooth convex components and a general, possibly non-differentiable, convex function. Alth…