Picture for Hua Ouyang

Hua Ouyang

Federated Unbiased Learning to Rank

Add code
May 11, 2021
Figure 1 for Federated Unbiased Learning to Rank
Figure 2 for Federated Unbiased Learning to Rank
Viaarxiv icon

Ultra High-Dimensional Nonlinear Feature Selection for Big Biological Data

Add code
Aug 14, 2016
Figure 1 for Ultra High-Dimensional Nonlinear Feature Selection for Big Biological Data
Figure 2 for Ultra High-Dimensional Nonlinear Feature Selection for Big Biological Data
Figure 3 for Ultra High-Dimensional Nonlinear Feature Selection for Big Biological Data
Figure 4 for Ultra High-Dimensional Nonlinear Feature Selection for Big Biological Data
Viaarxiv icon

Scaling Submodular Maximization via Pruned Submodularity Graphs

Add code
Jun 01, 2016
Figure 1 for Scaling Submodular Maximization via Pruned Submodularity Graphs
Figure 2 for Scaling Submodular Maximization via Pruned Submodularity Graphs
Figure 3 for Scaling Submodular Maximization via Pruned Submodularity Graphs
Figure 4 for Scaling Submodular Maximization via Pruned Submodularity Graphs
Viaarxiv icon

N$^3$LARS: Minimum Redundancy Maximum Relevance Feature Selection for Large and High-dimensional Data

Add code
Nov 10, 2014
Figure 1 for N$^3$LARS: Minimum Redundancy Maximum Relevance Feature Selection for Large and High-dimensional Data
Figure 2 for N$^3$LARS: Minimum Redundancy Maximum Relevance Feature Selection for Large and High-dimensional Data
Figure 3 for N$^3$LARS: Minimum Redundancy Maximum Relevance Feature Selection for Large and High-dimensional Data
Figure 4 for N$^3$LARS: Minimum Redundancy Maximum Relevance Feature Selection for Large and High-dimensional Data
Viaarxiv icon

Stochastic ADMM for Nonsmooth Optimization

Add code
Jan 22, 2013
Viaarxiv icon

Stochastic Smoothing for Nonsmooth Minimizations: Accelerating SGD by Exploiting Structure

Add code
Oct 01, 2012
Figure 1 for Stochastic Smoothing for Nonsmooth Minimizations: Accelerating SGD by Exploiting Structure
Figure 2 for Stochastic Smoothing for Nonsmooth Minimizations: Accelerating SGD by Exploiting Structure
Figure 3 for Stochastic Smoothing for Nonsmooth Minimizations: Accelerating SGD by Exploiting Structure
Figure 4 for Stochastic Smoothing for Nonsmooth Minimizations: Accelerating SGD by Exploiting Structure
Viaarxiv icon

Data-Distributed Weighted Majority and Online Mirror Descent

Add code
May 11, 2011
Figure 1 for Data-Distributed Weighted Majority and Online Mirror Descent
Figure 2 for Data-Distributed Weighted Majority and Online Mirror Descent
Figure 3 for Data-Distributed Weighted Majority and Online Mirror Descent
Figure 4 for Data-Distributed Weighted Majority and Online Mirror Descent
Viaarxiv icon