Jie Chen

Orcid: 0000-0001-9532-5091

Affiliations:
  • IBM Research, MIT-IBM Watson AI Lab, Cambridge, MI, USA
  • Argonne National Laboratory, Mathematics and Computer Science Division, Lemont, IL, USA (former)
  • University of Minnesota, Minneapolis, MN, USA (PhD 2010)


According to our database1, Jie Chen authored at least 67 papers between 2008 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Parallel and distributed asynchronous adaptive stochastic gradient methods.
Math. Program. Comput., September, 2023

A Decentralized Primal-Dual Framework for Non-Convex Smooth Consensus Optimization.
IEEE Trans. Signal Process., 2023

Bridging mean-field games and normalizing flows with trajectory regularization.
J. Comput. Phys., 2023

Communication-Efficient Graph Neural Networks with Probabilistic Neighborhood Expansion Analysis and Caching.
CoRR, 2023

GUAP: Graph Universal Attack Through Adversarial Patching.
CoRR, 2023

Hierarchical Grammar-Induced Geometry for Data-Efficient Molecular Property Prediction.
Proceedings of the International Conference on Machine Learning, 2023

Graph Neural Network-Inspired Kernels for Gaussian Processes in Semi-Supervised Learning.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Proximal Stochastic Recursive Momentum Methods for Nonconvex Composite Decentralized Optimization.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Distributed Stochastic Inertial-Accelerated Methods with Delayed Derivatives for Nonconvex Problems.
SIAM J. Imaging Sci., 2022

Accelerating Training and Inference of Graph Neural Networks with Fast Sampling and Pipelining.
Proceedings of Machine Learning and Systems 2022, 2022

Data-Efficient Graph Grammar Learning for Molecular Generation.
Proceedings of the Tenth International Conference on Learning Representations, 2022

2021
Distributed stochastic inertial methods with delayed derivatives.
CoRR, 2021

Graph coarsening: From scientific computing to machine learning.
CoRR, 2021

Project CodeNet: A Large-Scale AI for Code Dataset for Learning a Diversity of Coding Tasks.
CoRR, 2021

Noise Injection-based Regularization for Point Cloud Processing.
CoRR, 2021

Generating a Doppelganger Graph: Resembling but Distinct.
CoRR, 2021

CodeNet: A Large-Scale AI for Code Dataset for Learning a Diversity of Coding Tasks.
Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1, 2021

Graph Universal Adversarial Attacks: A Few Bad Actors Ruin Graph Learning Models.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Directed Acyclic Graph Neural Networks.
Proceedings of the 9th International Conference on Learning Representations, 2021

Discrete Graph Structure Learning for Forecasting Multiple Time Series.
Proceedings of the 9th International Conference on Learning Representations, 2021

PARAD: A Work-Efficient Parallel Algorithm for Reverse-Mode Automatic Differentiation.
Proceedings of the 2nd Symposium on Algorithmic Principles of Computer Systems, 2021

Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Asynchronous parallel adaptive stochastic gradient methods.
CoRR, 2020

CAG: A Real-Time Low-Cost Enhanced-Robustness High-Transferability Content-Aware Adversarial Attack Generator.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Online Planner Selection with Graph Neural Networks and Adaptive Scheduling.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Embedding Compression with Isotropic Iterative Quantization.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning.
Multiscale Model. Simul., 2019

Chart Auto-Encoders for Manifold Structured Data.
CoRR, 2019

Anti-Money Laundering in Bitcoin: Experimenting with Graph Convolutional Networks for Financial Forensics.
CoRR, 2019

IPC: A Benchmark Data Set for Learning with Graph-Structured Data.
CoRR, 2019

EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs.
CoRR, 2019

Graph Enhanced Cross-Domain Text-to-SQL Generation.
Proceedings of the Thirteenth Workshop on Graph-Based Methods for Natural Language Processing, 2019

DAG-GNN: DAG Structure Learning with Graph Neural Networks.
Proceedings of the 36th International Conference on Machine Learning, 2019

A Sequential Set Generation Method for Predicting Set-Valued Outputs.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Learning low-complexity autoregressive models via proximal alternating minimization.
Syst. Control. Lett., 2018

A posteriori error estimate for computing tr(f(A)) by using the Lanczos method.
Numer. Linear Algebra Appl., 2018

Scalable Graph Learning for Anti-Money Laundering: A First Look.
CoRR, 2018

Adaptive Planner Scheduling with Graph Neural Networks.
CoRR, 2018

Stochastic Gradient Descent with Biased but Consistent Gradient Estimators.
CoRR, 2018

Constrained Generation of Semantically Valid Graphs via Regularizing Variational Autoencoders.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling.
Proceedings of the 6th International Conference on Learning Representations, 2018

2017
Fast Estimation of tr(f(A)) via Stochastic Lanczos Quadrature.
SIAM J. Matrix Anal. Appl., 2017

Hierarchically Compositional Kernels for Scalable Nonparametric Learning.
J. Mach. Learn. Res., 2017

Learning low-complexity autoregressive models with limited time sequence data.
Proceedings of the 2017 American Control Conference, 2017

2016
How Accurately Should I Compute Implicit Matrix-Vector Products When Applying the Hutchinson Trace Estimator?
SIAM J. Sci. Comput., 2016

Analysis and Practical Use of Flexible BiCGStab.
J. Sci. Comput., 2016

On Bochner's and Polya's Characterizations of Positive-Definite Kernels and the Respective Random Feature Maps.
CoRR, 2016

Revisiting Random Binning Features: Fast Convergence and Strong Parallelizability.
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

Efficient one-vs-one kernel ridge regression for speech recognition.
Proceedings of the 2016 IEEE International Conference on Acoustics, 2016

2014
A Fast Summation Tree Code for Matérn Kernel.
SIAM J. Sci. Comput., 2014

A parallel linear solver for multilevel Toeplitz systems with possibly several right-hand sides.
Parallel Comput., 2014

2013
On the Use of Discrete Laplace Operator for Preconditioning Kernel Matrices.
SIAM J. Sci. Comput., 2013

Parallelizing the Conjugate Gradient Algorithm for Multilevel Toeplitz Systems.
Proceedings of the International Conference on Computational Science, 2013

2012
Dense Subgraph Extraction with Application to Community Detection.
IEEE Trans. Knowl. Data Eng., 2012

A Matrix-free Approach for Solving the Parametric Gaussian Process Maximum Likelihood Problem.
SIAM J. Sci. Comput., 2012

Difference Filter Preconditioning for Large Covariance Matrices.
SIAM J. Matrix Anal. Appl., 2012

2011
Algebraic Distance on Graphs.
SIAM J. Sci. Comput., 2011

Computing f(A)b via Least Squares Polynomial Approximations.
SIAM J. Sci. Comput., 2011

A measure of the local connectivity between graph vertices.
Proceedings of the International Conference on Computational Science, 2011

Trace optimization and eigenproblems in dimension reduction methods.
Numer. Linear Algebra Appl., 2011

2009
Lanczos Vectors versus Singular Vectors for Effective Dimension Reduction.
IEEE Trans. Knowl. Data Eng., 2009

Fast Approximate <i>k</i>NN Graph Construction for High Dimensional Data via Recursive Lanczos Bisection.
J. Mach. Learn. Res., 2009

A Measure of the Connection Strengths between Graph Vertices with Applications
CoRR, 2009

Divide and Conquer Strategies for Effective Information Retrieval.
Proceedings of the SIAM International Conference on Data Mining, 2009

2008
On the Tensor SVD and the Optimal Low Rank Orthogonal Approximation of Tensors.
SIAM J. Matrix Anal. Appl., 2008

Architectural Modeling from Sparsely Scanned Range Data.
Int. J. Comput. Vis., 2008


  Loading...