Jingbang Chen

Orcid: 0000-0002-7279-0801

According to our database1, Jingbang Chen authored at least 24 papers between 2019 and 2026.

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

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Scalable Algorithm for Dynamic Quasi-clique Detection.
CoRR, May, 2026

Finding the Balance Rate of Uncertain Signed Graphs.
CoRR, May, 2026

BEAR: Towards Beam-Search-Aware Optimization for Recommendation with Large Language Models.
CoRR, January, 2026

TopKGAT: A Top-K Objective-Driven Architecture for Recommendation.
Proceedings of the ACM Web Conference 2026, 2026

2025
Scalable Approximate Biclique Counting over Large Bipartite Graphs.
Proc. VLDB Endow., December, 2025

FrontierCS: Evolving Challenges for Evolving Intelligence.
CoRR, December, 2025

Curing Miracle Steps in LLM Mathematical Reasoning with Rubric Rewards.
CoRR, October, 2025

Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index.
Proc. VLDB Endow., February, 2025

On the Power of Learning-Augmented Search Trees.
Proceedings of the Forty-second International Conference on Machine Learning, 2025

2024
Entrywise Approximate Laplacian Solving.
CoRR, 2024

Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index.
CoRR, 2024

Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks.
Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

Accurate Explanation Model for Image Classifiers using Class Association Embedding.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

2023
Mixup-Augmented Meta-Learning for Sample-Efficient Fine-Tuning of Protein Simulators.
CoRR, 2023

Sandpile Prediction on Structured Undirected Graphs.
CoRR, 2023

Active Globally Explainable Learning for Medical Images via Class Association Embedding and Cyclic Adversarial Generation.
CoRR, 2023

Hardness of Graph-Structured Algebraic and Symbolic Problems.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Distance Queries over Dynamic Interval Graphs.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Exponential Convergence of Sinkhorn Under Regularization Scheduling.
Proceedings of the SIAM Conference on Applied and Computational Discrete Algorithms, 2023

2022
On the Power of Learning-Augmented BSTs.
CoRR, 2022

Exponential Convergence of Sinkhorn Under Regularization Scheduling.
CoRR, 2022

2021
Unit-Weight Laplacians are Complete for Linear Systems Modulo $p$.
CoRR, 2021

2020
Fast Adaptively Weighted Matrix Factorization for Recommendation with Implicit Feedback.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Predicting Long-Term Scientific Impact Based on Multi-Field Feature Extraction.
IEEE Access, 2019


  Loading...