output
19932026
most citedElectromagnetic Force and Momentum

1.4k citations

Showing 2020 · cs.LGShow all

20 papers · 2 filters

cs.LG2020

Learning Graph Neural Networks with Approximate Gradient Descent

Qunwei Li, Shaofeng Zou, Wenliang Zhong

The first provably efficient algorithm for learning graph neural networks (GNNs) with one hidden layer for node information convolution is provided in this paper. Two types of GNNs…

cs.LG2020

Selective Eye-gaze Augmentation To Enhance Imitation Learning In Atari Games

Chaitanya Thammineni, Hemanth Manjunatha, Ehsan T. Esfahani

This paper presents the selective use of eye-gaze information in learning human actions in Atari games. Vast evidence suggests that our eye movement convey a wealth of information…

cs.LG2020★ 30 cited

A Review of Recent Advances of Binary Neural Networks for Edge Computing

Wenyu Zhao, Teli Ma, Xuan Gong +2

Edge computing is promising to become one of the next hottest topics in artificial intelligence because it benefits various evolving domains such as real-time unmanned aerial syste…

cs.LG2020★ 53 cited

Uncertainty Aware Semi-Supervised Learning on Graph Data

Xujiang Zhao, Feng Chen, Shu Hu +1

Thanks to graph neural networks (GNNs), semi-supervised node classification has shown the state-of-the-art performance in graph data. However, GNNs have not considered different ty…

cs.LG2020★ 1 cited

Interventional Domain Adaptation

Jun Wen, Changjian Shui, Kun Kuang +4

Domain adaptation (DA) aims to transfer discriminative features learned from source domain to target domain. Most of DA methods focus on enhancing feature transferability through d…

cs.LG2020★ 1 cited

Impact of Community Structure on Consensus Machine Learning

Bao Huynh, Haimonti Dutta, Dane Taylor

Consensus dynamics support decentralized machine learning for data that is distributed across a cloud compute cluster or across the internet of things. In these and other settings,…

cs.LG2020★ 11 cited

On Differentially Private Stochastic Convex Optimization with Heavy-tailed Data

Di Wang, Hanshen Xiao, Srini Devadas +1

In this paper, we consider the problem of designing Differentially Private (DP) algorithms for Stochastic Convex Optimization (SCO) on heavy-tailed data. The irregularity of such d…

cs.LG2020

Estimating Stochastic Linear Combination of Non-linear Regressions Efficiently and Scalably

Di Wang, Xiangyu Guo, Chaowen Guan +2

Recently, many machine learning and statistical models such as non-linear regressions, the Single Index, Multi-index, Varying Coefficient Index Models and Two-layer Neural Networks…

cs.LG2020★ 12 cited

Learning by Minimizing the Sum of Ranked Range

Shu Hu, Yiming Ying, Xin Wang +1

In forming learning objectives, one oftentimes needs to aggregate a set of individual values to a single output. Such cases occur in the aggregate loss, which combines individual l…

cs.LG2020★ 6 cited

Differentially Private (Gradient) Expectation Maximization Algorithm with Statistical Guarantees

Di Wang, Jiahao Ding, Lijie Hu +3

(Gradient) Expectation Maximization (EM) is a widely used algorithm for estimating the maximum likelihood of mixture models or incomplete data problems. A major challenge facing th…

cs.LG2020★ 2 cited

Variance-Reduced Off-Policy TDC Learning: Non-Asymptotic Convergence Analysis

Shaocong Ma, Yi Zhou, Shaofeng Zou

Variance reduction techniques have been successfully applied to temporal-difference (TD) learning and help to improve the sample complexity in policy evaluation. However, the exist…

cs.LG2020★ 2 cited

Learning Manifold Implicitly via Explicit Heat-Kernel Learning

Yufan Zhou, Changyou Chen, Jinhui Xu

Manifold learning is a fundamental problem in machine learning with numerous applications. Most of the existing methods directly learn the low-dimensional embedding of the data in…

cs.LG2020★ 26 cited

Continuous-in-Depth Neural Networks

Alejandro F. Queiruga, N. Benjamin Erichson, Dane Taylor +1

Recent work has attempted to interpret residual networks (ResNets) as one step of a forward Euler discretization of an ordinary differential equation, focusing mainly on syntactic…

cs.LG2020★ 149 cited

HiPPO: Recurrent Memory with Optimal Polynomial Projections

Albert Gu, Tri Dao, Stefano Ermon +2

A central problem in learning from sequential data is representing cumulative history in an incremental fashion as more data is processed. We introduce a general framework (HiPPO)…

cs.LG2020★ 4 cited

Generative Semantic Hashing Enhanced via Boltzmann Machines

Lin Zheng, Qinliang Su, Dinghan Shen +1

Generative semantic hashing is a promising technique for large-scale information retrieval thanks to its fast retrieval speed and small memory footprint. For the tractability of tr…

cs.LG2020

Stable and Efficient Policy Evaluation

Daoming Lyu, Bo Liu, Matthieu Geist +3

Policy evaluation algorithms are essential to reinforcement learning due to their ability to predict the performance of a policy. However, there are two long-standing issues lying…

cs.LG2020★ 8 cited

Finite-sample Analysis of Greedy-GQ with Linear Function Approximation under Markovian Noise

Yue Wang, Shaofeng Zou

Greedy-GQ is an off-policy two timescale algorithm for optimal control in reinforcement learning. This paper develops the first finite-sample analysis for the Greedy-GQ algorithm w…

cs.LG2020★ 28 cited

Feature Quantization Improves GAN Training

Yang Zhao, Chunyuan Li, Ping Yu +2

The instability in GAN training has been a long-standing problem despite remarkable research efforts. We identify that instability issues stem from difficulties of performing featu…

cs.LG2020

Kernel Bi-Linear Modeling for Reconstructing Data on Manifolds: The Dynamic-MRI Case

Gaurav N. Shetty, Konstantinos Slavakis, Ukash Nakarmi +2

This paper establishes a kernel-based framework for reconstructing data on manifolds, tailored to fit the dynamic-(d)MRI-data recovery problem. The proposed methodology exploits si…

cs.LG2020★ 1 cited

Network Clustering Via Kernel-ARMA Modeling and the Grassmannian The Brain-Network Case

Cong Ye, Konstantinos Slavakis, Pratik V. Patil +3

This paper introduces a clustering framework for networks with nodes annotated with time-series data. The framework addresses all types of network-clustering problems: State cluste…