English
Related papers

Related papers: Test-Time Augmentation for Traveling Salesperson P…

200 papers

Continual Test-Time Adaptation (CTTA) enables pre-trained models to adapt to continuously evolving domains. Existing methods have improved robustness but typically rely on fixed or batch-level thresholds, which cannot account for varying…

Computer Vision and Pattern Recognition · Computer Science 2025-12-10 Seunghwan Lee , Inyoung Jung , Hojoon Lee , Eunil Park , Sungeun Hong

Most neural solvers for the Traveling Salesperson Problem (TSP) are trained to output a single solution, even though practitioners rarely stop there: at test time, they routinely spend extra compute on sampling or post-hoc search. This…

Machine Learning · Computer Science 2026-05-04 Andoni Irazusta Garmendia

Combinatorial optimization plays an important role in real-world problem solving. In the big data era, the dimensionality of a combinatorial optimization problem is usually very large, which poses a significant challenge to existing…

Machine Learning · Computer Science 2020-09-09 Yuan Sun , Andreas Ernst , Xiaodong Li , Jake Weiner

Domain shift is a common problem in the realistic world, where training data and test data follow different data distributions. To deal with this problem, fully test-time adaptation (TTA) leverages the unlabeled data encountered during test…

Artificial Intelligence · Computer Science 2024-04-29 Guoliang Lin , Hanjiang Lai , Yan Pan , Jian Yin

Monitoring the growth of subcortical regions of the fetal brain in ultrasound (US) images can help identify the presence of abnormal development. Manually segmenting these regions is a challenging task, but recent work has shown that it can…

Computer Vision and Pattern Recognition · Computer Science 2025-02-14 Joshua Omolegan , Pak Hei Yeung , Madeleine K. Wyburd , Linde Hesse , Monique Haak , Intergrowth-21st Consortium , Ana I. L. Namburete , Nicola K. Dinsdale

Many real-world problems can be formulated as a constrained Traveling Salesman Problem (TSP). However, the constraints are always complex and numerous, making the TSPs challenging to solve. When the number of complicated constraints grows,…

Artificial Intelligence · Computer Science 2024-03-11 Jingxiao Chen , Ziqin Gong , Minghuan Liu , Jun Wang , Yong Yu , Weinan Zhang

In this paper, we present augmentation inside the network, a method that simulates data augmentation techniques for computer vision problems on intermediate features of a convolutional neural network. We perform these transformations,…

Computer Vision and Pattern Recognition · Computer Science 2023-06-27 Maciej Sypetkowski , Jakub Jasiulewicz , Zbigniew Wojna

Evolving diverse sets of high quality solutions has gained increasing interest in the evolutionary computation literature in recent years. With this paper, we contribute to this area of research by examining evolutionary diversity…

Neural and Evolutionary Computing · Computer Science 2021-10-04 Anh Viet Do , Jakob Bossek , Aneta Neumann , Frank Neumann

Real-world time series often exhibit a non-stationary nature, degrading the performance of pre-trained forecasting models. Test-Time Adaptation (TTA) addresses this by adjusting models during inference, but existing methods typically update…

Machine Learning · Computer Science 2025-07-01 Heitor R. Medeiros , Hossein Sharifi-Noghabi , Gabriel L. Oliveira , Saghar Irandoust

Test-Time Adaptation (TTA) enables pre-trained models to adjust to distribution shift by learning from unlabeled test-time streams. However, existing methods typically treat these streams as independent samples, overlooking the supervisory…

Machine Learning · Computer Science 2026-01-30 Young Kyung Kim , Oded Schlesinger , Qiangqiang Wu , J. Matías Di Martino , Guillermo Sapiro

We propose a non-autoregressive framework for the Travelling Salesman Problem where solutions emerge directly from learned permutations, without requiring explicit search. By applying a similarity transformation to Hamiltonian cycles, the…

Machine Learning · Computer Science 2025-09-25 Yimeng Min , Carla P. Gomes

The Traveling Salesperson Problem (TSP) is one of the best-known combinatorial optimisation problems. However, many real-world problems are composed of several interacting components. The Traveling Thief Problem (TTP) addresses such…

Neural and Evolutionary Computing · Computer Science 2020-06-08 Jakob Bossek , Aneta Neumann , Frank Neumann

Multi-modal test-time adaptation (MM-TTA) adapts models to an unlabeled target domain by leveraging the complementary multi-modal inputs in an online manner. While previous MM-TTA methods for 3D segmentation offer a promising solution by…

Computer Vision and Pattern Recognition · Computer Science 2025-10-07 Haozhi Cao , Yuecong Xu , Pengyu Yin , Xingyu Ji , Shenghai Yuan , Jianfei Yang , Lihua Xie

Test-Time Adaptation (TTA) aims to mitigate distributional shifts between training and test domains during inference time. However, existing TTA methods fall short in the realistic scenario where models face both continually changing…

Computer Vision and Pattern Recognition · Computer Science 2026-04-24 Yingkai Yang , Chaoqi Chen , Hui Huang

Document-level machine translation faces the challenge of data sparsity due to its long input length and a small amount of training data, increasing the risk of learning spurious patterns. To address this challenge, we propose a target-side…

Computation and Language · Computer Science 2023-06-06 Guangsheng Bao , Zhiyang Teng , Yue Zhang

The Traveling Salesman Problem (TSP) is among the most famous NP-hard optimization problems. We design for this problem a randomized polynomial-time algorithm that computes a (1+eps)-approximation to the optimal tour, for any fixed eps>0,…

Computational Complexity · Computer Science 2016-09-09 Yair Bartal , Lee-Ad Gottlieb , Robert Krauthgamer

Test-Time Adaptation (TTA) addresses distribution shifts during testing by adapting a pretrained model without access to source data. In this work, we propose a novel TTA approach for 3D point cloud classification, combining sampling…

Conventional test-time adaptation (TTA) approaches typically adapt the model using only a small fraction of test samples, often those with low-entropy predictions, thereby failing to fully leverage the available information in the test…

Computer Vision and Pattern Recognition · Computer Science 2026-04-21 Nam Nguyen Phuong , Duc Nguyen The Minh , Phi Le Nguyen , Ehsan Abbasnejad , Minh Hoai

Test-Time Adaptation (TTA) has recently emerged as a promising approach for tackling the robustness challenge under distribution shifts. However, the lack of consistent settings and systematic studies in prior literature hinders thorough…

Machine Learning · Computer Science 2023-06-07 Hao Zhao , Yuejiang Liu , Alexandre Alahi , Tao Lin

Since distribution shifts are likely to occur during test-time and can drastically decrease the model's performance, online test-time adaptation (TTA) continues to update the model after deployment, leveraging the current test data.…

Computer Vision and Pattern Recognition · Computer Science 2023-10-27 Robert A. Marsden , Mario Döbler , Bin Yang
‹ Prev 1 3 4 5 6 7 10 Next ›