
Achieving Statistical Optimality of Federated Learning: Beyond Stationary Points
Federated Learning (FL) is a promising framework that has great potentia...
read it

WASE: Learning When to Attend for Speaker Extraction in Cocktail Party Environments
In the speaker extraction problem, it is found that additional informati...
read it

Onepass Stochastic Gradient Descent in Overparametrized Twolayer Neural Networks
There has been a recent surge of interest in understanding the convergen...
read it

MIMO Selfattentive RNN Beamformer for Multispeaker Speech Separation
Recently, our proposed recurrent neural network (RNN) based all deep lea...
read it

The planted matching problem: Sharp threshold and infiniteorder phase transition
We study the problem of reconstructing a perfect matching M^* hidden in ...
read it

LearnerPrivate Online Convex Optimization
Online convex optimization is a framework where a learner sequentially q...
read it

The Power of Dhops in Matching PowerLaw Graphs
This paper studies seeded graph matching for powerlaw graphs. Assume th...
read it

Speaker and Direction Inferred Dualchannel Speech Separation
Most speech separation methods, trying to separate all channel sources s...
read it

Settling the Sharp Reconstruction Thresholds of Random Graph Matching
This paper studies the problem of recovering the hidden vertex correspon...
read it

Audiovisual Speech Separation with Adversarially Disentangled Visual Representation
Speech separation aims to separate individual voice from an audio mixtur...
read it

Testing correlation of unlabeled random graphs
We study the problem of detecting the edge correlation between two rando...
read it

Sequence to MultiSequence Learning via Conditional Chain Mapping for Mixture Signals
Neural sequencetosequence models are well established for applications...
read it

SpeakerConditional Chain Model for Speech Separation and Extraction
Speech separation has been extensively explored to tackle the cocktail p...
read it

Graph Matching with PartiallyCorrect Seeds
The graph matching problem aims to find the latent vertex correspondence...
read it

AllorNothing Phenomena: From SingleLetter to High Dimensions
We consider the linear regression problem of estimating a pdimensional ...
read it

The Planted Matching Problem: Phase Transitions and Exact Results
We study the problem of recovering a planted matching in randomly weight...
read it

DMRM: A Dualchannel Multihop Reasoning Model for Visual Dialog
Visual Dialog is a visionlanguage task that requires an AI agent to eng...
read it

Consistent recovery threshold of hidden nearest neighbor graphs
Motivated by applications such as discovering strong ties in social netw...
read it

Optimal query complexity for private sequential learning
Motivated by privacy concerns in many practical applications such as Fed...
read it

Spectral Graph Matching and Regularized Quadratic Relaxations II: ErdősRényi Graphs and Universality
We analyze a new spectral graph matching algorithm, GRAph Matching by Pa...
read it

Spectral Graph Matching and Regularized Quadratic Relaxations I: The Gaussian Model
Graph matching aims at finding the vertex correspondence between two unl...
read it

POG: Personalized Outfit Generation for Fashion Recommendation at Alibaba iFashion
Increasing demand for fashion recommendation raises a lot of challenges ...
read it

The AllorNothing Phenomenon in Sparse Linear Regression
We study the problem of recovering a hidden binary ksparse pdimensiona...
read it

Improved queuesize scaling for inputqueued switches via graph factorization
This paper studies the scaling of the expected total queue size in an n×...
read it

Efficient random graph matching via degree profiles
Random graph matching refers to recovering the underlying vertex corresp...
read it

Concept Learning through Deep Reinforcement Learning with MemoryAugmented Neural Networks
Deep neural networks have shown superior performance in many regimes to ...
read it

Convex Relaxation Methods for Community Detection
This paper surveys recent theoretical advances in convex optimization ap...
read it

Cascaded Mutual Modulation for Visual Reasoning
Visual reasoning is a special visual question answering problem that is ...
read it

Seeded Graph Matching via Large Neighborhood Statistics
We study a well known noisy model of the graph isomorphism problem. In t...
read it

Statistical Problems with Planted Structures: InformationTheoretical and Computational Limits
Over the past few years, insights from computer science, statistical phy...
read it

Securing Distributed Machine Learning in High Dimensions
We consider securing a distributed machine learning system wherein the d...
read it

Hidden Hamiltonian Cycle Recovery via Linear Programming
We introduce the problem of hidden Hamiltonian cycle recovery, where the...
read it

Rates of Convergence of Spectral Methods for Graphon Estimation
This paper studies the problem of estimating the grahpon model  the und...
read it

Distributed Statistical Machine Learning in Adversarial Settings: Byzantine Gradient Descent
We consider the problem of distributed statistical machine learning in a...
read it

Learning from Comparisons and Choices
When tracking userspecific online activities, each user's preference is...
read it

SelfTaught Convolutional Neural Networks for Short Text Clustering
Short text clustering is a challenging problem due to its sparseness of ...
read it

Text Classification Improved by Integrating Bidirectional LSTM with Twodimensional Max Pooling
Recurrent Neural Network (RNN) is one of the most popular architectures ...
read it

Hierarchical Memory Networks for Answer Selection on Unknown Words
Recently, endtoend memory networks have shown promising results on Que...
read it

Semidefinite Programs for Exact Recovery of a Hidden Community
We study a semidefinite programming (SDP) relaxation of the maximum like...
read it

Convexified Modularity Maximization for Degreecorrected Stochastic Block Models
The stochastic block model (SBM) is a popular framework for studying com...
read it

Submatrix localization via message passing
The principal submatrix localization problem deals with recovering a K× ...
read it

Recovering a Hidden Community Beyond the Spectral Limit in O(E ^*V) Time
Community detection is considered for a stochastic block model graph of ...
read it

Information Limits for Recovering a Hidden Community
We study the problem of recovering a hidden community of cardinality K f...
read it

Density Evolution in the Degreecorrelated Stochastic Block Model
There is a recent surge of interest in identifying the sharp recovery th...
read it

Local Algorithms for Block Models with Side Information
There has been a recent interest in understanding the power of local alg...
read it

Collaboratively Learning Preferences from Ordinal Data
In applications such as recommendation systems and revenue management, i...
read it

Short Text Hashing Improved by Integrating MultiGranularity Topics and Tags
Due to computational and storage efficiencies of compact binary codes, h...
read it

Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions
Resolving a conjecture of Abbe, Bandeira and Hall, the authors have rece...
read it

Clustering and Inference From Pairwise Comparisons
Given a set of pairwise comparisons, the classical ranking problem compu...
read it

Reconstruction in the Labeled Stochastic Block Model
The labeled stochastic block model is a random graph model representing ...
read it
Jiaming Xu
is this you? claim profile
Assistant Professor of Krannert School of Management at Purdue University