activity
20132024
most citedRethinking the Smaller-Norm-Less-Informative Assumption in Channel Pruning of Convolution Layers

149 citations · 414 across the 15 of their papers we have counts for

collaborators

15 papers

cs.CV2024★ 7 cited

gsplat: An Open-Source Library for Gaussian Splatting

Vickie Ye, Ruilong Li, Justin Kerr +8

gsplat is an open-source library designed for training and developing Gaussian Splatting methods. It features a front-end with Python bindings compatible with the PyTorch library a…

cs.CV2018★ 100 cited

ARBEE: Towards Automated Recognition of Bodily Expression of Emotion In the Wild

Yu Luo, Jianbo Ye, Reginald B. Adams +3

Humans are arguably innately prepared to comprehend others' emotional expressions from subtle body movements. If robots or computers can be empowered with this capability, a number…

cs.CL2018★ 101 cited

Investigating Capsule Networks with Dynamic Routing for Text Classification

Wei Zhao, Jianbo Ye, Min Yang +3

In this study, we explore capsule networks with dynamic routing for text classification. We propose three strategies to stabilize the dynamic routing process to alleviate the distu…

cs.LG2018★ 149 cited

Rethinking the Smaller-Norm-Less-Informative Assumption in Channel Pruning of Convolution Layers

Jianbo Ye, Xin Lu, Zhe Lin +1

Model pruning has become a useful technique that improves the computational efficiency of deep learning, making it possible to deploy solutions in resource-limited scenarios. A wid…

cs.CV2018★ 19 cited

Detecting Comma-shaped Clouds for Severe Weather Forecasting using Shape and Motion

Xinye Zheng, Jianbo Ye, Yukun Chen +5

Meteorologists use shapes and movements of clouds in satellite images as indicators of several major types of severe storms. Satellite imaginary data are in increasingly higher res…

cs.LG2018★ 15 cited

Active Learning of Strict Partial Orders: A Case Study on Concept Prerequisite Relations

Chen Liang, Jianbo Ye, Han Zhao +2

Strict partial order is a mathematical structure commonly seen in relational data. One obstacle to extracting such type of relations at scale is the lack of large-scale labels for…

cs.DS2017★ 1 cited

A Faster Drop-in Implementation for Leaf-wise Exact Greedy Induction of Decision Tree Using Pre-sorted Deque

Jianbo Ye

This short article presents a new implementation for decision trees. By introducing pre-sorted deques, the leaf-wise greedy tree growing strategy no longer needs to re-sort data at…

cs.IR2017★ 5 cited

Leveraging Long and Short-term Information in Content-aware Movie Recommendation

Wei Zhao, Haixia Chai, Benyou Wang +4

Movie recommendation systems provide users with ranked lists of movies based on individual's preferences and constraints. Two types of models are commonly used to generate ranking…

cs.LG2017

Aggregated Wasserstein Metric and State Registration for Hidden Markov Models

Yukun Chen, Jianbo Ye, Jia Li

We propose a framework, named Aggregated Wasserstein, for computing a dissimilarity measure or distance between two Hidden Markov Models with state conditional distributions being…

stat.ML2017★ 2 cited

Probabilistic Multigraph Modeling for Improving the Quality of Crowdsourced Affective Data

Jianbo Ye, Jia Li, Michelle G. Newman +2

We proposed a probabilistic approach to joint modeling of participants' reliability and humans' regularity in crowdsourced affective studies. Reliability measures how likely a subj…

cs.LG2016★ 2 cited

A Distance for HMMs based on Aggregated Wasserstein Metric and State Registration

Yukun Chen, Jianbo Ye, Jia Li

We propose a framework, named Aggregated Wasserstein, for computing a dissimilarity measure or distance between two Hidden Markov Models with state conditional distributions being…

stat.CO2016★ 5 cited

A Simulated Annealing based Inexact Oracle for Wasserstein Loss Minimization

Jianbo Ye, James Z. Wang, Jia Li

Learning under a Wasserstein loss, a.k.a. Wasserstein loss minimization (WLM), is an emerging research topic for gaining insights from a large set of structured objects. Despite be…

stat.CO2015★ 7 cited

Fast Discrete Distribution Clustering Using Wasserstein Barycenter with Sparse Support

Jianbo Ye, Panruo Wu, James Z. Wang +1

In a variety of research areas, the weighted bag of vectors and the histogram are widely used descriptors for complex objects. Both can be expressed as discrete distributions. D2-c…

cs.GR2015

On the Approximation Theory of Linear Variational Subspace Design

Jianbo Ye, Zhixin Yan

Solving large-scale optimization on-the-fly is often a difficult task for real-time computer graphics applications. To tackle this challenge, model reduction is a well-adopted tech…

cs.LG2013★ 1 cited

Multiple Closed-Form Local Metric Learning for K-Nearest Neighbor Classifier

Jianbo Ye

Many researches have been devoted to learn a Mahalanobis distance metric, which can effectively improve the performance of kNN classification. Most approaches are iterative and com…