
SoftTriple Loss: Deep Metric Learning Without Triplet Sampling
Distance metric learning (DML) is to learn the embeddings where examples...
read it

DR Loss: Improving Object Detection by Distributional Ranking
Most of object detection algorithms can be categorized into two classes:...
read it

XNAS: Neural Architecture Search with Expert Advice
This paper introduces a novel optimization method for differential neura...
read it

Robust Gaussian Process Regression for RealTime High Precision GPS Signal Enhancement
Satellitebased positioning system such as GPS often suffers from large ...
read it

On the Computation and Communication Complexity of Parallel SGD with Dynamic Batch Sizes for Stochastic NonConvex Optimization
For SGD based distributed stochastic optimization, computation complexit...
read it

On the Linear Speedup Analysis of Communication Efficient Momentum SGD for Distributed NonConvex Optimization
Recent developments on largescale distributed machine learning applicat...
read it

Conservative Exploration for SemiBandits with Linear Generalization: A Product Selection Problem for Urban Warehouses
The recent rising popularity of ultrafast delivery services on retail p...
read it

Which Factorization Machine Modeling is Better: A Theoretical Answer with Optimal Guarantee
Factorization machine (FM) is a popular machine learning model to captur...
read it

Why Does Stagewise Training Accelerate Convergence of Testing Error Over SGD?
Stagewise training strategy is commonly used for learning neural network...
read it

Stochastic Optimization for DC Functions and Nonsmooth Nonconvex Regularizers with Nonasymptotic Convergence
Difference of convex (DC) functions cover a broad family of nonconvex a...
read it

Largescale Distance Metric Learning with Uncertainty
Distance metric learning (DML) has been studied extensively in the past ...
read it

Learning with NonConvex Truncated Losses by SGD
Learning with a convex loss function has been a dominating paradigm for...
read it

Robust Optimization over Multiple Domains
Recently, machine learning becomes important for the cloud computing ser...
read it

Fast Rates of ERM and Stochastic Approximation: Adaptive to Error Bound Conditions
Error bound conditions (EBC) are properties that characterize the growth...
read it

Multinomial Logit Bandit with Linear Utility Functions
Multinomial logit bandit is a sequential subset selection problem which ...
read it

NEON+: Accelerated Gradient Methods for Extracting Negative Curvature for NonConvex Optimization
Accelerated gradient (AG) methods are breakthroughs in convex optimizati...
read it

Extremely Low Bit Neural Network: Squeeze the Last Bit Out with ADMM
Although deep learning models are highly effective for various learning ...
read it

Tracking Slowly Moving Clairvoyant: Optimal Dynamic Regret of Online Learning with True and Noisy Gradient
This work focuses on dynamic regret of online convex optimization that c...
read it

An Explicit Sampling Dependent Spectral Error Bound for Column Subset Selection
In this paper, we consider the problem of column subset selection. We pr...
read it

Analysis of Nuclear Norm Regularization for Fullrank Matrix Completion
In this paper, we provide a theoretical analysis of the nuclearnorm reg...
read it

Theory of Dualsparse Regularized Randomized Reduction
In this paper, we study randomized reduction methods, which reduce high...
read it

Top Rank Optimization in Linear Time
Bipartite ranking aims to learn a realvalued ranking function that orde...
read it

CUR Algorithm with Incomplete Matrix Observation
CUR matrix decomposition is a randomized algorithm that can efficiently ...
read it

Binary Excess Risk for Smooth Convex Surrogates
In statistical learning theory, convex surrogates of the 01 loss are hi...
read it

FineGrained Visual Categorization via Multistage Metric Learning
Finegrained visual categorization (FGVC) is to categorize objects into ...
read it

Excess Risk Bounds for Exponentially Concave Losses
The overarching goal of this paper is to derive excess risk bounds for l...
read it

Beating the Minimax Rate of Active Learning with Prior Knowledge
Active learning refers to the learning protocol where the learner is all...
read it

Sparse Multiple Kernel Learning with Geometric Convergence Rate
In this paper, we study the problem of sparse multiple kernel learning (...
read it

An Improved Bound for the Nystrom Method for Large Eigengap
We develop an improved bound for the approximation error of the Nyström ...
read it

A Bayesian Approach toward Active Learning for Collaborative Filtering
Collaborative filtering is a useful technique for exploiting the prefere...
read it

A Simple Algorithm for Semisupervised Learning with Improved Generalization Error Bound
In this work, we develop a simple algorithm for semisupervised regressi...
read it

Bayesian Active Distance Metric Learning
Distance metric learning is an important component for many tasks, such ...
read it

A Bayesian Framework for Community Detection Integrating Content and Link
This paper addresses the problem of community detection in networked dat...
read it

Robust Metric Learning by Smooth Optimization
Most existing distance metric learning methods assume perfect side infor...
read it
Rong Jin
is this you? claim profile
Research Scientist at Facebook, Research Assistant at Indiana University Bloomington from 20102017, Assistant Instructor at Indiana University Bloomington from 20102014, Data Analyst at Megaputer Intelligence Inc. 2013