Birdie Blog

Thinking will not overcome fear but action will.

Merkle2:A Low-Latency Transparency Log System

隐私保护 透明日志

Merkle2:A Low-Latency Transparency Log System 2021 IEEE Symposium on Security and Privacy (SP) Yuncong Hu, Kian Hooshmand, Harika Kalidhindi, Seung Jin Yang*, Raluca Ada Popa 加利福利亚大学,伯克利 摘要 透明...

H-TSP Hierarchically Solving the Large-Scale Travelling Salesman Problem

AAAI2023 分治 大规模TSP

H-TSP Hierarchically Solving the Large-Scale Travelling Salesman Problem AAAI 2023 杭州电子科技大学和微软亚洲研究所 摘要 本文提出了一个基于分层强化学习的端到端学习框架,称为H-TSP,用于解决大规模旅行商问题(TSP)。该方法包含两个策略:上层策略用于将原始的规模较大的问题拆解成多个规模较小的子问题...

Compositional Messagepassing Neural Network (CMPNN)

IJCAI2020 CMPNN

Compositional Messagepassing Neural Network (CMPNN) 选自: Communicative Representation Learning on Attributed Molecular Graphs(IJCAI20) A reinforcement learning approach for optimizing multipl...

SplitNet A Reinforcement Learning Based Sequence Splitting Method for the MinMax Multiple Travelling Salesman Problem

AAAI2023 从TSP重构MinMax mTSP

SplitNet: A Reinforcement Learning Based Sequence Splitting Method for the MinMax Multiple Travelling Salesman Problem AAAI23 天津大学和华为诺亚方舟实验室 摘要 MinMax Multiple Travelling Salesman Problem(mTSP)...

Looking Ahead to Avoid Being Late Solving Hard-Constrained Traveling Salesman Problem

Arxiv

Looking Ahead to Avoid Being Late: Solving Hard-Constrained Traveling Salesman Problem https://arxiv.org/abs/2403.05318v1 (我感觉整体一般) 摘要 许多现实问题都可以被表述为受限旅行商问题(TSP)。然而,约束条件总是复杂和众多的,使得求解tsp具有挑战性。当复杂...

MVMoE Multi-Task Vehicle Routing Solver with Mixture-of-Experts

ICML2024 混合专家层

MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Experts 代码:https://github.com/RoyalSkye/Routing-MVMoE 摘要 学习求解车辆路径问题(vrp)已经引起了人们的广泛关注。然而,大多数神经解算器仅针对特定问题进行结构化和独立训练,这使得它们不那么通用和实用。在本文中,我们...

EFFICIENT TRAINING OF MULTI-TASK COMBINAROTIAL NEURAL SOLVER WITH MULTI-ARMED BANDITS

多臂赌博机 多任务神经组合优化求解器

EFFICIENT TRAINING OF MULTI-TASK COMBINAROTIAL NEURAL SOLVER WITH MULTI-ARMED BANDITS 使用多臂赌博机(MAB)高效训练多任务神经组合优化求解器 https://arxiv.org/abs/2305.06361 (没太仔细研究,在看MVMoE: Multi-Task Vehicle Routing ...

Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instances

AAAI2021 分支热图预测 + MCTS

Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instances 将一个小的预训练模型推广到任意大的TSP实例 AAAI2021 代码:https://github.com/Spider-scnu/TSP (用到的 k-opt 和NIPS23有一篇很相似) 摘要 对于旅行商问题(TSP),现有的基于监督...

A linearithmic heuristic for the travelling salesman problem

EJOR2021 分治求解TSP

A linearithmic heuristic for the travelling salesman problem European Journal of Operational Research 2021 University of Applied Sciences of Western Switzerland 方法 RecorderPath 输入:...

Unsupervised Learning Permutations for TSP using Gumbel-Sinkhorn Operator

NIPS23 学习置换 + 不同分布的泛化 + 理论解释

Unsupervised Learning Permutations for TSP using Gumbel-Sinkhorn Operator 基于Gumbel-Sinkhorn算子的TSP无监督学习置换 来自康奈尔大学 (这篇文章和NIPS23 Unsupervised Learning for Solving the Travelling Salesman Problem是同一...