PPaperPicks

Guoren Wang

Beijing Institute of Technology, School of Computer Science & Technology, Beijing, China

86 papers at tracked venues · 79 at CORE A* · active 20242026

Venues

Frequent coauthors

Papers

  1. BRIEF: Bi-level Coreset Selection for Efficient Instruction Tuning in LLMs
  2. DORA: A Dual-Objective Reinforcement Learning Framework for Effective and Efficient Multimodal Agentic Search
  3. Demystifying Uncertainty in LLMs: Active Calibration between Concepts and Human Evaluations
  4. PAGE: A Unified Approach for Federated Graph Unlearning
  5. Querying Historical $k$-Dense Subgraphs on Temporal Graphs
  6. Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs
  7. Unstructured Data Analysis using LLMs: A Comprehensive Benchmark
  8. Unveiling the Vulnerability of Graph-LLMs: An Interpretable Multi-Dimensional Adversarial Attack on TAGs
  9. Aquila: A High-Concurrency System for Incremental Graph Query
  10. Backdoor Attacks on Graph Classification via Data Augmentation and Dynamic Poisoning
  11. Budgeted Strong Community Search in Heterogeneous Graphs
  12. Counting Cohesive Subgraphs with Hereditary Properties
  13. CrossEM: A Prompt Tuning Framework for Cross-Modal Entity Matching
  14. CrossETR: A Semantic-Driven Framework for Entity Matching Across Images and Graph
  15. Density Decomposition of Bipartite Graphs
  16. DiRW: Path-Aware Digraph Learning for Heterophily
  17. DocDB: A Database for Unstructured Document Analysis
  18. Doctopus: A System for Budget-aware Structural Data Extraction from Unstructured Documents
  19. Doctopus: Budget-aware Structural Table Extraction from Unstructured Documents
  20. Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: A Labelling Approach
  21. Efficient Index Maintenance for Effective Resistance Computation on Evolving Graphs
  22. Efficient Maximum Fair Clique Search Over Large Networks
  23. Fira: Can We Achieve Full-rank Training of LLMs Under Low-rank Constraint?
  24. Generalization Bounds for Kolmogorov-Arnold Networks (KANs) and Enhanced KANs with Lower Lipschitz Complexity
  25. GraphMaster: Automated Graph Synthesis via LLM Agents in Data-Limited Environments
  26. Handling Label Noise via Instance-Level Difficulty Modeling and Dynamic Optimization
  27. Harnessing Diversity for Important Data Selection in Pretraining Large Language Models
  28. Improved Algorithms for Effective Resistance Computation on Graphs
  29. Integral Densest Subgraph Search on Directed Graphs
  30. Lava: Language Driven Scalable and Versatile Traffic Video Analytics
  31. Motivation-Aware Session Planning over Heterogeneous Social Platforms
  32. One Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor
  33. OpenFGL: A Comprehensive Benchmark for Federated Graph Learning
  34. OpenGU: A Comprehensive Benchmark for Graph Unlearning
  35. Prompt Tuning In a Compact Attribute Space
  36. QUEST: Query Optimization in Unstructured Document Analysis
  37. QaVA: Query-Aware Video Analysis Framework Based on Data Access Pattern
  38. Rethinking Client-oriented Federated Graph Learning
  39. Scaling Up k-Clique Percolation Community Detection
  40. The Power of Core Clique Removal for Exact Clique Enumeration
  41. Theoretically and Practically Efficient Maximum Biclique Search
  42. Toward Data-centric Directed Graph Learning: An Entropy-driven Approach
  43. Toward Effective Digraph Representation Learning: A Magnetic Adaptive Propagation based Approach
  44. Towards Multi-Table Learning: A Novel Paradigm for Complementarity Quantification and Integration
  45. Truss Decomposition in Hypergraphs
  46. Two Birds with One Stone: Efficient Deep Learning over Mislabeled Data through Subset Selection
  47. AdaFGL: A New Paradigm for Federated Node Classification with Topology Heterogeneity
  48. Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs
  49. Authenticated Keyword Search on Large-Scale Graphs in Hybrid-Storage Blockchains
  50. Authenticated Subgraph Matching in Hybrid-Storage Blockchains
  51. Breaking the Entanglement of Homophily and Heterophily in Semi-supervised Node Classification
  52. Cooperative Global Path Planning for Multiple Platforms
  53. Cross Online Ride-Sharing for Multiple-Platform Cooperations in Spatial Crowdsourcing
  54. Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs
  55. Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs
  56. Efficient Community Search in Edge-Attributed Graphs (Extended Abstract)
  57. Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee
  58. Efficient Partial Order Based Transaction Processing for Permissioned Blockchains
  59. Efficient and Effective Anchored Densest Subgraph Search: A Convex-programming based Approach
  60. Efficient and Provable Effective Resistance Computation on Large Graphs: An Index-based Approach
  61. FDNet: Feature Decoupling Framework for Trajectory Prediction
  62. Feed: Towards Personalization-Effective Federated Learning
  63. GShop: Towards Flexible Pricing for Graph Statistics
  64. I/O Efficient Max-Truss Computation in Large Static and Dynamic Graphs
  65. IDE: A System for Iterative Mislabel Detection
  66. ITPNet: Towards Instantaneous Trajectory Prediction for Autonomous Driving
  67. Importance-aware Shared Parameter Subspace Learning for Domain Incremental Learning
  68. Keypoint-based Progressive Chain-of-Thought Distillation for LLMs
  69. LaKD: Length-agnostic Knowledge Distillation for Trajectory Prediction with Any Length Observations
  70. LakeBench: A Benchmark for Discovering Joinable and Unionable Tables in Data Lakes
  71. LakeCompass: An End-to-End System for Table Maintenance, Search and Analysis in Data Lakes
  72. LightDiC: A Simple yet Effective Approach for Large-scale Digraph Representation Learning
  73. Maximal Biclique Enumeration: A Prefix Tree Based Approach
  74. Mining Quasi-Periodic Communities in Temporal Network
  75. MisDetect: Iterative Mislabel Detection using Early Loss
  76. Mitigating Data Scarcity in Supervised Machine Learning Through Reinforcement Learning Guided Data Generation
  77. Multivariate Time Series Cleaning under Speed Constraints
  78. On the Road to Portability: Compressing End-to-End Motion Planner for Autonomous Driving
  79. Privacy-Preserving Graph Embedding based on Local Differential Privacy
  80. RL-ISLAP: A Reinforcement Learning Framework for Industrial-Scale Linear Assignment Problems at Alipay
  81. Rethinking Node-wise Propagation for Large-scale Graph Learning
  82. Self-Training GNN-based Community Search in Large Attributed Heterogeneous Information Networks
  83. Separation Is for Better Reunion: Data Lake Storage at Huawei
  84. Theoretically and Practically Efficient Maximum Defective Clique Search
  85. Topology-preserving Graph Coarsening: An Elementary Collapse-based Approach
  86. Towards Effective and General Graph Unlearning via Mutual Evolution