1 code implementation • 8 Oct 2024 • Jenna Fromer, Runzhong Wang, Mrunali Manjrekar, Austin Tripp, José Miguel Hernández-Lobato, Connor W. Coley
Batched Bayesian optimization (BO) can accelerate molecular design by efficiently identifying top-performing compounds from a large chemical library.
2 code implementations • 6 Sep 2024 • Runzhong Wang, Yang Li, Junchi Yan, Xiaokang Yang
In this paper, we design a family of non-autoregressive neural networks to solve CO problems under positive linear constraints with the following merits.
1 code implementation • 18 Jul 2024 • Runzhong Wang, Yunhao Zhang, Ziao Guo, Tianyi Chen, Xiaokang Yang, Junchi Yan
Encoding constraints into neural networks is attractive.
2 code implementations • 8 Jul 2024 • Kevin Yu, Jihye Roh, Ziang Li, Wenhao Gao, Runzhong Wang, Connor W. Coley
Under this formulation, we propose Double-Ended Synthesis Planning (DESP), a novel CASP algorithm under a bidirectional graph search scheme that interleaves expansions from the target and from the goal starting materials to ensure constraint satisfiability.
1 code implementation • 14 Nov 2023 • Jinpei Guo, Shaofeng Zhang, Runzhong Wang, Chang Liu, Junchi Yan
Meanwhile, on Pascal VOC, QueryTrans improves the accuracy of NGMv2 from $80. 1\%$ to $\mathbf{83. 3\%}$, and BBGM from $79. 0\%$ to $\mathbf{84. 5\%}$.
Ranked #1 on
Graph Matching
on PASCAL VOC
(matching accuracy metric)
1 code implementation • 13 Nov 2023 • Haoyu Geng, Hang Ruan, Runzhong Wang, Yang Li, Yang Wang, Lei Chen, Junchi Yan
Our study shows that PnO approaches are better than PtO on 7 out of 8 benchmarks, but there is no silver bullet found for the specific design choices of PnO.
1 code implementation • 8 Nov 2023 • Wujiang Xu, Qitian Wu, Runzhong Wang, Mingming Ha, Qiongxu Ma, Linxun Chen, Bing Han, Junchi Yan
To address these challenges under open-world assumptions, we design an \textbf{A}daptive \textbf{M}ulti-\textbf{I}nterest \textbf{D}ebiasing framework for cross-domain sequential recommendation (\textbf{AMID}), which consists of a multi-interest information module (\textbf{MIM}) and a doubly robust estimator (\textbf{DRE}).
1 code implementation • CVPR 2023 • Runzhong Wang, Ziao Guo, Shaofei Jiang, Xiaokang Yang, Junchi Yan
Graph matching (GM) aims at discovering node matching between graphs, by maximizing the node- and edge-wise affinities between the matched elements.
Ranked #1 on
Graph Matching
on Willow Object Class
(F1 score metric)
1 code implementation • 18 Apr 2022 • Wujiang Xu, Runzhong Wang, Xiaobo Guo, Shaoshuai Li, Qiongxu Ma, Yunan Zhao, Sheng Guo, Zhenfeng Zhu, Junchi Yan
However, the optimal video summaries need to reflect the most valuable keyframe with its own information, and one with semantic power of the whole content.
1 code implementation • CVPR 2022 • Qibing Ren, Qingquan Bao, Runzhong Wang, Junchi Yan
We first show that an adversarial attack on keypoint localities and the hidden graphs can cause significant accuracy drop to deep GM models.
Ranked #7 on
Graph Matching
on PASCAL VOC
(matching accuracy metric)
no code implementations • 28 Dec 2021 • Han Lu, Zenan Li, Runzhong Wang, Qibing Ren, Junchi Yan, Xiaokang Yang
Solving combinatorial optimization (CO) on graphs is among the fundamental tasks for upper-stream applications in data mining, machine learning and operations research.
no code implementations • 29 Sep 2021 • Runzhong Wang, Li Shen, Yiting Chen, Junchi Yan, Xiaokang Yang, DaCheng Tao
Cardinality constrained combinatorial optimization requires selecting an optimal subset of $k$ elements, and it will be appealing to design data-driven algorithms that perform TopK selection over a probability distribution predicted by a neural network.
1 code implementation • NeurIPS 2021 • Runzhong Wang, Zhigang Hua, Gan Liu, Jiayi Zhang, Junchi Yan, Feng Qi, Shuang Yang, Jun Zhou, Xiaokang Yang
Combinatorial Optimization (CO) has been a long-standing challenging research topic featured by its NP-hard nature.
no code implementations • 1 Jan 2021 • Tianshu Yu, Runzhong Wang, Junchi Yan, Baoxin Li
Graph matching (GM) has been traditionally modeled as a deterministic optimization problem characterized by an affinity matrix under pre-defined graph topology.
2 code implementations • 16 Dec 2020 • Chang Liu, Zetian Jiang, Runzhong Wang, Junchi Yan, Lingxiao Huang, Pinyan Lu
As such, the agent can finish inlier matching timely when the affinity score stops growing, for which otherwise an additional parameter i. e. the number of inliers is needed to avoid matching outliers.
1 code implementation • NeurIPS 2020 • Runzhong Wang, Junchi Yan, Xiaokang Yang
This paper considers the setting of jointly matching and clustering multiple graphs belonging to different groups, which naturally rises in many realistic problems.
Ranked #2 on
Graph Matching
on Willow Object Class
1 code implementation • CVPR 2021 • Runzhong Wang, Tianqi Zhang, Tianshu Yu, Junchi Yan, Xiaokang Yang
This paper presents a hybrid approach by combing the interpretability of traditional search-based techniques for producing the edit path, as well as the efficiency and adaptivity of deep embedding models to achieve a cost-effective GED solver.
1 code implementation • TPAMI 2020 • Runzhong Wang, Junchi Yan and Xiaokang Yang.
Our approach enjoys flexibility in that the permutation loss is agnostic to the number of nodes, and the embedding model is shared among nodes such that the network can deal with varying numbers of nodes for both training and inference.
Ranked #3 on
Graph Matching
on CUB
no code implementations • ICLR 2020 • Tianshu Yu, Runzhong Wang, Junchi Yan, Baoxin Li
Graph matching aims to establishing node-wise correspondence between two graphs, which is a classic combinatorial problem and in general NP-complete.
Ranked #16 on
Graph Matching
on PASCAL VOC
(matching accuracy metric)
1 code implementation • 26 Nov 2019 • Runzhong Wang, Junchi Yan, Xiaokang Yang
We also show how to extend our network to hypergraph matching, and matching of multiple graphs.
Ranked #7 on
Graph Matching
on SPair-71k
3 code implementations • ICCV 2019 • Hao-Shu Fang, Jianhua Sun, Runzhong Wang, Minghao Gou, Yong-Lu Li, Cewu Lu
With the guidance of such map, we boost the performance of R101-Mask R-CNN on instance segmentation from 35. 7 mAP to 37. 9 mAP without modifying the backbone or network structure.
Ranked #80 on
Instance Segmentation
on COCO test-dev
1 code implementation • ICCV 2019 • Runzhong Wang, Junchi Yan, Xiaokang Yang
In addition with its NP-completeness nature, another important challenge is effective modeling of the node-wise and structure-wise affinity across graphs and the resulting objective, to guide the matching procedure effectively finding the true matching against noises.