Demo Data from VLDB 2026 / reviewers in the wild / expert
Qingchun Hou
dblp:249/5756
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2026
0000-0001-8334-9897ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Mathematical optimization · 67% Computational complexity · 33% | |
| Artificial intelligence
1 paper |
Optimization for machine learning · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Energy systems and smart grids · 67% Smart cities and intelligent transportation · 33% |
Topics — the 8 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity
constraint satisfaction |
1.0 | 1 | 2026 | T-SKM-Net: Trainable Neural Network Framework for Linear Constraint Satisfaction via Sampling Kaczmarz-Motzkin Method · AAAI 2026 |
Mathematical optimization › continuous optimization
convex optimization |
1.0 | 1 | 2026 | T-SKM-Net: Trainable Neural Network Framework for Linear Constraint Satisfaction via Sampling Kaczmarz-Motzkin Method · AAAI 2026 |
Mathematical optimization
linear programming |
1.0 | 1 | 2026 | T-SKM-Net: Trainable Neural Network Framework for Linear Constraint Satisfaction via Sampling Kaczmarz-Motzkin Method · AAAI 2026 |
Machine learning › Optimization for machine learning
combinatorial optimization |
0.7 | 1 | 2023 | Generalize Learned Heuristics to Solve Large-scale Vehicle Routing Problems in Real-time · ICLR 2023 |
Machine learning › Optimization for machine learning › combinatorial optimization
neural combinatorial optimization |
0.7 | 1 | 2023 | Generalize Learned Heuristics to Solve Large-scale Vehicle Routing Problems in Real-time · ICLR 2023 |
Machine learning › Optimization for machine learning › combinatorial optimization
vehicle routing |
0.7 | 1 | 2023 | Generalize Learned Heuristics to Solve Large-scale Vehicle Routing Problems in Real-time · ICLR 2023 |
Energy systems and smart grids
power system operation |
0.7 | 1 | 2023 | Data-Driven Security and Stability Rule in High Renewable Penetrated Power System Operation · Proc. IEEE 2023 |
Smart cities and intelligent transportation › mobility-on-demand
supply-demand balancing |
0.7 | 1 | 2023 | Data-Driven Security and Stability Rule in High Renewable Penetrated Power System Operation · Proc. IEEE 2023 |
Methods — techniques the papers use, named apart from their topics
sampling kaczmarz-motzkin · 1.0null space transformation · 1.0backpropagation · 1.0reinforcement learning · 0.7machine learning · 0.7learned heuristics · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | T-SKM-Net: Trainable Neural Network Framework for Linear Constraint Satisfaction via Sampling Kaczmarz-Motzkin MethodabstractNeural network constraint satisfaction is crucial for safety-critical applications such as power system optimization, robotic path planning, and autonomous driving. However, existing constraint satisfaction methods face efficiency-applicability trade-offs, with hard constraint methods suffering from either high computational complexity or restrictive assumptions on constraint structures. The Sampling Kaczmarz-Motzkin (SKM) method is a randomized iterative algorithm for solving large-scale linear inequality systems with favorable convergence properties, but its argmax operations introduce non-differentiability, posing challenges for neural network applications. This work proposes the Trainable Sampling Kaczmarz-Motzkin Network (T-SKM-Net) framework and, for the first time, systematically integrates SKM-type methods into neural network constraint satisfaction. The framework transforms mixed constraint problems into pure inequality problems through null space transformation, employs SKM for iterative solving, and maps solutions back to the original constraint space, efficiently handling both equality and inequality constraints. We provide theoretical proof of post-processing effectiveness in expectation and end-to-end trainability guarantees based on unbiased gradient estimators, demonstrating that despite non-differentiable operations, the framework supports standard backpropagation. On the DCOPF case118 benchmark, our method achieves 4.27ms/item GPU serial forward inference with 0.0025% max optimality gap with post-processing mode and 5.25ms/item with 0.0008% max optimality gap with joint training mode, delivering over 25× speedup compared to the pandapower solver while maintaining zero constraint violations under given tolerance. Jiashen Ren, Qingchun Hou |
AAAI | 4 |
| 2023 | Generalize Learned Heuristics to Solve Large-scale Vehicle Routing Problems in Real-time
Qingchun Hou, Yiqiang Su, Yuming Deng |
ICLR | 1 |
| 2023 | Data-Driven Security and Stability Rule in High Renewable Penetrated Power System OperationabstractPower systems around the world are experiencing an energy revolution that substitutes fossil fuels with renewable energy. Such a transition poses two significant challenges: highly variable generators that add short-term and long-term difficulties for supply–demand balance, and a high proportion of convertor-based devices that may jeopardize power system security and stability. At the same time, machine learning techniques provide more opportunities to study the complex power system security and stability problems. This article summarizes the machine learning framework to embed security rules into power system operation optimization under high renewable energy penetration. First, we explore how high penetration renewable energy impacts power system security and stability. Then, we review how the complex security and stability boundary of power systems is modeled using various machine learning techniques. Finally, we show how the machine learning model is transformed into optimization constraints that can be embedded into the power system operation model. The framework is substantiated through case studies of practical power systems. Ning Zhang 0008, Hongyang Jia, Qingchun Hou |
Proc. IEEE | 3 |