Search Results for author:
Found 8 papers, 0 papers with code
A Sinkhorn-type Algorithm for Constrained Optimal Transport
We derive the corresponding entropy regularization formulation and introduce a Sinkhorn-type algorithm for such constrained OT problems supported by theoretical guarantees.
Accelerating Sinkhorn Algorithm with Sparse Newton Iterations
To achieve possibly super-exponential convergence, we present Sinkhorn-Newton-Sparse (SNS), an extension to the Sinkhorn algorithm, by introducing early stopping for the matrix scaling steps and a second stage featuring a Newton-type subroutine.
Multi-Objective Optimization via Wasserstein-Fisher-Rao Gradient Flow
Multi-objective optimization (MOO) aims to optimize multiple, possibly conflicting objectives with widespread applications.
Toward Understanding Privileged Features Distillation in Learning-to-Rank
Such features naturally arise in merchandised recommendation systems; for instance, "user clicked this item" as a feature is predictive of "user purchased this item" in the offline data, but is clearly not available during online serving.
Online Non-Additive Path Learning under Full and Partial Information
We study the problem of online path learning with non-additive gains, which is a central problem appearing in several applications, including ensemble structured prediction.
Online Dynamic Programming
We consider the problem of repeatedly solving a variant of the same dynamic programming problem in successive trials.
Deep Embedding Forest: Forest-based Serving with Deep Embedding Features
Built on top of a representative DNN model called Deep Crossing, and two forest/tree-based models including XGBoost and LightGBM, a two-step Deep Embedding Forest algorithm is demonstrated to achieve on-par or slightly better performance as compared with the DNN counterpart, with only a fraction of serving time on conventional hardware.
Online Learning of Combinatorial Objects via Extended Formulation
We present applications of our framework to online learning of Huffman trees and permutations.
