{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T07:33:23Z","timestamp":1763192003926,"version":"3.45.0"},"reference-count":39,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T00:00:00Z","timestamp":1751241600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T00:00:00Z","timestamp":1751241600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,30]]},"DOI":"10.1109\/ijcnn64981.2025.11229180","type":"proceedings-article","created":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T18:46:15Z","timestamp":1763145975000},"page":"1-8","source":"Crossref","is-referenced-by-count":0,"title":["Enhancing Branching Policy Generalization through Self-Supervised Adversarial Instance Augmentation"],"prefix":"10.1109","author":[{"given":"Ce","family":"Zhang","sequence":"first","affiliation":[{"name":"Chinese Academy of Sciences,Institute of Automation"}]},{"given":"Bin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Chinese Academy of Sciences,Institute of Automation"}]},{"given":"Xinyue","family":"Lu","sequence":"additional","affiliation":[{"name":"Chinese Academy of Sciences,Institute of Automation"}]},{"given":"Guoliang","family":"Fan","sequence":"additional","affiliation":[{"name":"Chinese Academy of Sciences,Institute of Automation"}]}],"member":"263","reference":[{"volume-title":"Handbooks in operations research and management science: Transportation","year":"2006","author":"Barnhart","key":"ref1"},{"article-title":"Estimating or propagating gradients through stochastic neurons for conditional computation","year":"2013","author":"Bengio","key":"ref2"},{"article-title":"The SCIP Optimization Suite 9.0. Technical report, Optimization Online","year":"2024","author":"Bolusani","key":"ref3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1080.0688"},{"article-title":"Bert: Pre-training of deep bidirectional transformers for language understanding","year":"2019","author":"Devlin","key":"ref5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i02.5503"},{"key":"ref7","first-page":"220","article-title":"The machine learning for combinatorial optimization competition (ml4co): Results and insights","volume-title":"Proceedings of the NeurIPS 2021 Competitions and Demonstrations Track. Proceedings of Machine Learning Research","volume":"176","author":"Gasse"},{"key":"ref8","article-title":"Exact combinatorial optimization with graph convolutional neural networks","volume":"32","author":"Gasse","year":"2019","journal-title":"Advances in neural information processing systems"},{"article-title":"A deep instance generative framework for MILP solvers under limited data availability","volume-title":"Thirty-seventh Conference on Neural Information Processing Systems","author":"Geng","key":"ref9"},{"key":"ref10","first-page":"18087","article-title":"Hybrid models for learning to branch","volume":"33","author":"Gupta","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.22271\/ed.book.2064","article-title":"Lookback for learning to branch","volume-title":"Transactions on Machine Learning Research","author":"Gupta","year":"2022"},{"volume-title":"Gurobi Optimizer Reference Manual","year":"2024","key":"ref12"},{"journal-title":"Mastering diverse domains through world models","year":"2023","author":"Hafner","key":"ref13"},{"volume-title":"A gnn-guided predict-and-search framework for mixed-integer linear programming","year":"2023","author":"Han","key":"ref14"},{"article-title":"TD-MPC2: Scalable, robust world models for continuous control","volume-title":"The Twelfth International Conference on Learning Representations","author":"Hansen","key":"ref15"},{"key":"ref16","article-title":"Learning to search in branch and bound algorithms","volume-title":"Advances in Neural Information Processing Systems","volume":"27","author":"He","year":"2014"},{"article-title":"Masked autoencoders are scalable vision learners","year":"2021","author":"He","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.108353"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i9.21262"},{"volume-title":"Auto-encoding variational bayes","year":"2022","author":"Kingma","key":"ref20"},{"volume-title":"Variational graph auto-encoders","year":"2016","author":"Kipf","key":"ref21"},{"key":"ref22","article-title":"Learning to compare nodes in branch and bound with graph neural networks","volume-title":"Advances in Neural Information Processing Systems","author":"Labassi","year":"2022"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68279-0_5"},{"volume-title":"Promoting generalization for exact solvers via adversarial instance augmentation","year":"2023","author":"Liu","key":"ref24"},{"volume-title":"Solving mixed integer programs using neural networks","year":"2021","author":"Nair","key":"ref25"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/7.4.308"},{"key":"ref27","volume-title":"Production planning by mixed integer programming","volume":"149","author":"Pochet","year":"2006"},{"key":"ref28","article-title":"Ecole: A gym-like library for machine learning in combinatorial optimization solvers","volume-title":"Learning Meets Combinatorial Algorithms at NeurIPS2020","author":"Prouvost","year":"2020"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-024-02130-y"},{"key":"ref30","first-page":"18514","article-title":"Learning to branch with tree mdps","volume-title":"Advances in Neural Information Processing Systems","volume":"35","author":"Scavuzzo","year":"2022"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.12794\/metadc1505267"},{"volume-title":"Learning a large neighborhood search algorithm for mixed integer programs","year":"2022","author":"Sonnerat","key":"ref32"},{"article-title":"Reinforcement learning for integer programming: learning to cut","volume-title":"Proceedings of the 37th International Conference on Machine Learning","author":"Tang","key":"ref33"},{"key":"ref34","article-title":"Generalizing to unseen domains via adversarial data augmentation","volume":"31","author":"Volpi","year":"2018","journal-title":"Advances in neural information processing systems"},{"article-title":"G2milp: Learning to generate mixed-integer linear programming instances for milp solvers","year":"2023","author":"Wang","key":"ref35"},{"article-title":"Learning cut selection for mixed-integer linear programming via hierarchical sequence model","volume-title":"The Eleventh International Conference on Learning Representations","author":"Wang","key":"ref36"},{"key":"ref37","article-title":"Learning large neighborhood search policy for integer programming","volume-title":"Advances in Neural Information Processing Systems","author":"Wu","year":"2021"},{"article-title":"Understanding straight-through estimator in training activation quantized neural nets","volume-title":"International Conference on Learning Representations","author":"Yin","key":"ref38"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16512"}],"event":{"name":"2025 International Joint Conference on Neural Networks (IJCNN)","start":{"date-parts":[[2025,6,30]]},"location":"Rome, Italy","end":{"date-parts":[[2025,7,5]]}},"container-title":["2025 International Joint Conference on Neural Networks (IJCNN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11227166\/11227148\/11229180.pdf?arnumber=11229180","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T07:30:04Z","timestamp":1763191804000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11229180\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,30]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/ijcnn64981.2025.11229180","relation":{},"subject":[],"published":{"date-parts":[[2025,6,30]]}}}