
Offensive Language and Hate Speech Detection with Deep Learning and Transfer Learning
Toxic online speech has become a crucial problem nowadays due to an expo...
read it

Deterministic Mincut in AlmostLinear Time
We present a deterministic (global) mincut algorithm for weighted, undir...
read it

A Nearly Optimal AllPairs MinCuts Algorithm in Simple Graphs
We give an n^2+o(1)time algorithm for finding st mincuts for all pair...
read it

Deterministic Weighted Expander Decomposition in Almostlinear Time
In this note, we study the expander decomposition problem in a more gene...
read it

A Quasipolynomial (2+ε)Approximation for Planar Sparsest Cut
The (nonuniform) sparsest cut problem is the following graphpartitioni...
read it

Minimum Cuts in Directed Graphs via √(n) MaxFlows
We give an algorithm to find a mincut in an nvertex, medge weighted di...
read it

O(1) Steiner Point Removal in SeriesParallel Graphs
We study how to vertexsparsify a graph while preserving both the graph'...
read it

Vertex Connectivity in Polylogarithmic Maxflows
The vertex connectivity of an medge nvertex undirected graph is the sm...
read it

Tight Bound on Vertex Cut Sparsifiers in Directed Acyclic Graphs
For an unweighted graph on k terminals, Kratsch and Wahlström constructe...
read it

A Lightweight Algorithm to Uncover Deep Relationships in Data Tables
Many data we collect today are in tabular form, with rows as records and...
read it

Optimal Bounds for the kcut Problem
In the kcut problem, we want to find the smallest set of edges whose de...
read it

Cycle TextToImage GAN with BERT
We explore novel approaches to the task of image generation from their r...
read it

Planar Diameter via Metric Compression
We develop a new approach for distributed distance computation in planar...
read it

The KargerStein Algorithm is Optimal for kcut
In the kcut problem, we are given an edgeweighted graph and want to fi...
read it

Faster Parallel Algorithm for Approximate Shortest Path
We present the first m polylog(n) work, polylog(n) time algorithm in the...
read it

Mellotron: Multispeaker expressive voice synthesis by conditioning on rhythm, pitch and global style tokens
Mellotron is a multispeaker voice synthesis model based on Tacotron 2 GS...
read it

A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond
We consider the classical Minimum Balanced Cut problem: given a graph G,...
read it

Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and kVertex
We study deterministic algorithms for computing graph cuts, with focus o...
read it

Faster Minimum kcut of a Simple Graph
We consider the (exact, minimum) kcut problem: given a graph and an int...
read it

NeMo: a toolkit for building AI applications using Neural Modules
NeMo (Neural Modules) is a Python frameworkagnostic toolkit for creatin...
read it

Detecting Feedback Vertex Sets of Size k in O^(2.7^k) Time
In the Feedback Vertex Set problem, one is given an undirected graph G a...
read it

The Number of Minimum kCuts: Improving the KargerStein Bound
Given an edgeweighted graph, how many minimum kcuts can it have? This ...
read it

Stochastic Gradient Methods with Layerwise Adaptive Moments for Training of Deep Networks
We propose NovoGrad, a firstorder stochastic gradient method with layer...
read it

Tight FPT Approximations for kMedian and kMeans
We investigate the finegrained complexity of approximating the classica...
read it

Jasper: An EndtoEnd Convolutional Neural Acoustic Model
In this paper, we report stateoftheart results on LibriSpeech among e...
read it

Training Neural Speech Recognition Systems with Synthetic Speech Augmentation
Building an accurate automatic speech recognition (ASR) system requires ...
read it

Faster Exact and Approximate Algorithms for kCut
In the kcut problem, we are given an edgeweighted graph G and an integ...
read it

Distributed Treewidth Computation
Of all the restricted graph families out there, the family of low treewi...
read it

NonPreemptive FlowTime Minimization via Rejections
We consider the online problem of minimizing weighted flowtime on unrel...
read it

Distributed Computation in the NodeCongested Clique
The Congested Clique model of distributed computing, which was introduce...
read it

New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms
We show that many classical optimization problems  such as (1±ϵ)appr...
read it

Losing Treewidth by Separating Subsets
We study the problem of deleting the smallest set S of vertices (resp.ed...
read it

Faster Distributed Shortest Path Approximations via Shortcuts
A long series of recent results and breakthroughs have led to faster and...
read it

Minor Excluded Network Families Admit Fast Distributed Algorithms
Distributed network optimization algorithms, such as minimum spanning tr...
read it

Improved Distributed Algorithms for Exact Shortest Paths
Computing shortest paths is one of the central problems in the theory of...
read it
Jason Li
is this you? claim profile