Fast nearest neighbor searching is becoming an increasingly important tool in solving many large-scale problems. Recently a number of approaches to learning data-dependent hash functions have been developed. In this work, we propose a column generation based method for learning data-dependent hash functions on the basis of proximity comparison information. Given a set of triplets that encode the pairwise proximity comparison information, our method learns hash functions that preserve the relative comparison relationships in the data as well as possible within the large-margin learning framework. The learning procedure is implemented using column generation and hence is named CGHash. At each iteration of the column generation procedure, the best hash function is selected. Unlike most other hashing methods, our method generalizes to new data points naturally; and has a training objective which is convex, thus ensuring that the global optimum can be identified. Experiments demonstrate that the proposed method learns compact binary codes and that its retrieval performance compares favorably with state-of-the-art methods when tested on a few benchmark datasets.
SSAH: Semi-supervised Adversarial Deep Hashing with Self-paced Hard Sample Generation
The Harbin Institute of Technology(哈尔滨工业大学);Alibaba DAMO Academy, Alibaba Group(阿里巴巴集团达摩院);Nanyang Technological University(南洋理工大学);Xiamen University(厦门大学)
Reinforcement Learning for Solving the Pricing Problem in Column Generation: Applications to Vehicle Routing
Department of Information Systems, Faculty of Industrial Engineering and Innovation Sciences, Technical University Eindhoven, The Netherlands(信息系统系,工业工程与创新科学学院,埃因霍温技术大学,荷兰);Department of Mathematics, College of Computing and Mathematical Sciences, Khalifa University, United Arab Emirates(数学系,计算与数学科学学院,哈利法大学,阿联酋)
Partial Column Generation with Graph Neural Networks for Team Formation and Routing
School of Management, Department of Operations & Technology(管理学院、运营与技术系);Technical University of Munich(慕尼黑技术大学);Department of Information Systems(信息系统系);Eindhoven University of Technology(埃因霍温理工大学)
Machine Learning-Enhanced Ant Colony Optimization for Column Generation
School of Computing Technologies, RMIT University(RMIT大学计算技术学院);University of Technology Sydney(悉尼科技大学);La Trobe Business School, La Trobe University(拉筹伯大学拉筹伯商学院)
Accelerating Column Generation via Flexible Dual Optimal Inequalities with Application to Entity Resolution
University of Wisconsin-Madison(威斯康星大学麦迪逊分校);Verisk Computational and Human Intelligence Laboratory(韦里斯科计算与人类智能实验室);University of Pennsylvania(宾夕法尼亚大学)
Machine-learning-based arc selection for constrained shortest path problems in column generation
Polytechnique Montréal(蒙特利尔理工学院);GERAD(GERAD 运筹学研究中心);Canada Excellence Research Chair in Data Science for Real-Time Decision-Making, Polytechnique Montréal(加拿大数据科学实时决策卓越研究教席,蒙特利尔理工学院)