
Deep Neural Tangent Kernel and Laplace Kernel Have the Same RKHS
We prove that the reproducing kernel Hilbert spaces (RKHS) of a deep neu...
read it

Region Comparison Network for Interpretable Fewshot Image Classification
While deep learning has been successfully applied to many realworld com...
read it

Multiple Descent: Design Your Own Generalization Curve
This paper explores the generalization loss of linear regression in vari...
read it

Joint MultiUser DNN Partitioning and Computational Resource Allocation for Collaborative Edge Intelligence
Mobile Edge Computing (MEC) has emerged as a promising supporting archit...
read it

CoarsetoFine PseudoLabeling Guided MetaLearning for FewShot Classification
To endow neural networks with the potential to learn rapidly from a hand...
read it

Computational Complexity Characterization of Protecting Elections from Bribery
The bribery problem in election has received considerable attention in t...
read it

Meta Learning in the Continuous Time Limit
In this paper, we establish the ordinary differential equation (ODE) tha...
read it

Prioritizing documentation effort: Can we do better?
Code documentations are essential for software quality assurance, but du...
read it

Hybrid Cryptocurrency Pump and Dump Detection
Increasingly growing Cryptocurrency markets have become a hive for scamm...
read it

The Curious Case of Adversarially Robust Models: More Data Can Help, Double Descend, or Hurt Generalization
Despite remarkable success, deep neural networks are sensitive to human...
read it

Deep Fusion of Local and NonLocal Features for Precision Landslide Recognition
Precision mapping of landslide inventory is crucial for hazard mitigatio...
read it

More Data Can Expand the Generalization Gap Between Adversarially Robust and Standard Models
Despite remarkable success in practice, modern machine learning models h...
read it

Nonlinear Blockchain Scalability: a GameTheoretic Perspective
Recent advances in the blockchain research have been made in two importa...
read it

Differentially Private Combinatorial Cloud Auction
Cloud service providers typically provide different types of virtual mac...
read it

An Adaptive and Fast Convergent Approach to Differentially Private Deep Learning
With the advent of the era of big data, deep learning has become a preva...
read it

TransMatch: A TransferLearning Scheme for SemiSupervised FewShot Learning
The successful application of deep learning to many visual recognition t...
read it

OpenEnded Visual Question Answering by MultiModal Domain Adaptation
We study the problem of visual question answering (VQA) in images by exp...
read it

MAT: A simple yet strong baseline for identifying selfadmitted technical debt
In the process of software evolution, developers often sacrifice the lon...
read it

Online Continuous Submodular Maximization: From FullInformation to Bandit Feedback
In this paper, we propose three online algorithms for submodular maximis...
read it

LocalitySensitive Hashing for fDivergences: Mutual Information Loss and Beyond
Computing approximate nearest neighbors in high dimensional spaces is a ...
read it

Minimax Regret of SwitchingConstrained Online Convex Optimization: No Phase Transition
We study the problem of switchingconstrained online convex optimization...
read it

Private and Atomic Exchange of Assets over Zero Knowledge Based Payment Ledger
Bitcoin brings a new type of digital currency that does not rely on a ce...
read it

Differentially Private Aggregated Mobility Data Publication Using Moving Characteristics
With the rapid development of GPS enabled devices (smartphones) and loca...
read it

Knownclass Aware Selfensemble for Open Set Domain Adaptation
Existing domain adaptation methods generally assume different domains ha...
read it

Categorical Feature Compression via Submodular Optimization
In the era of big data, learning from categorical features with very lar...
read it

Covering a tree with rooted subtrees
We consider the multiple traveling salesman problem on a weighted tree. ...
read it

WIDER Face and Pedestrian Challenge 2018: Methods and Results
This paper presents a review of the 2018 WIDER Challenge on Face and Ped...
read it

Quantized FrankWolfe: CommunicationEfficient Distributed Optimization
How can we efficiently mitigate the overhead of gradient communications ...
read it

Heterogeneous Coexistence of Cognitive Radio Networks in TV White Space
Wireless standards (e.g., IEEE 802.11af and 802.22) have been developed ...
read it

Black Box Submodular Maximization: Discrete and Continuous Settings
In this paper, we consider the problem of black box continuous submodula...
read it

Differentially Private Userbased Collaborative Filtering Recommendation Based on Kmeans Clustering
Collaborative filtering (CF) recommendation algorithms are wellknown fo...
read it

Optimal Algorithms for Scheduling under TimeofUse Tariffs
We consider a natural generalization of classical scheduling problems in...
read it

A general framework for handling commitment in online throughput maximization
We study a fundamental online job admission problem where jobs with dead...
read it

Unconstrained Submodular Maximization with Constant Adaptive Complexity
In this paper, we consider the unconstrained submodular maximization pro...
read it

Efficient Public Blockchain Client for Lightweight Users
Public blockchains provide a decentralized method for storing transactio...
read it

Election with Bribed Voter Uncertainty: Hardness and Approximation Algorithm
Bribery in election (or computational social choice in general) is an im...
read it

PPMCSA: Privacy Preserving MultiChannel Double Spectrum Auction
Auction is widely regarded as an effective way in dynamic spectrum redis...
read it

ProjectionFree Bandit Convex Optimization
In this paper, we propose the first computationally efficient projection...
read it

On the Graver basis of blockstructured integer programming
We consider the 4block nfold integer programming (IP), in which the co...
read it

ProjectionFree Online Optimization with Stochastic Gradient: From Convexity to Submodularity
Online optimization has been a successful framework for solving largesc...
read it

Comparison Based Learning from Weak Oracles
There is increasing interest in learning algorithms that involve interac...
read it

Online Continuous Submodular Maximization
In this paper, we consider an online optimization process, where the obj...
read it

Distributionally Robust MeanVariance Portfolio Selection with Wasserstein Distances
We revisit Markowitz's meanvariance portfolio selection model by consid...
read it

Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?
Submodular functions are a broad class of set functions, which naturally...
read it

Estimating the Size of a Large Network and its Communities from a Random Sample
Most realworld networks are too large to be measured or studied directl...
read it

Submodular Variational Inference for Network Reconstruction
In realworld and online social networks, individuals receive and transm...
read it

NearOptimal Active Learning of Halfspaces via Query Synthesis in the Noisy Setting
In this paper, we consider the problem of actively learning a linear cla...
read it

Finding Needles in a Haystack: Missing Tag Detection in Large RFID Systems
Radio frequency identification (RFID) technology has been widely used in...
read it

Seeing the Unseen Network: Inferring Hidden Social Ties from RespondentDriven Sampling
Learning about the social structure of hidden and hardtoreach populati...
read it
Lin Chen
is this you? claim profile