paper-with-me

Papers

Lookahead Adversarial Learning for Near Real-Time Semantic Segmentation

2020-06-19 · Hadi Jamali-Rad, Attila Szabo

Semantic segmentation is one of the most fundamental problems in computer vision with significant impact on a wide variety of applications. Adversarial learning is shown to be an effective approach for improving semantic segmentation quality by enforcing higher-level pixel correlations and structural information. However, state-of-the-art semantic segmentation models cannot be easily plugged into an adversarial setting because they are not designed to accommodate convergence and stability issues in adversarial networks. We bridge this gap by building a conditional adversarial network with a state-of-the-art segmentation model (DeepLabv3+) at its core. To battle the stability issues, we introduce a novel lookahead adversarial learning (LoAd) approach with an embedded label map aggregation module. We focus on semantic segmentation models that run fast at inference for near real-time field applications. Through extensive experimentation, we demonstrate that the proposed solution can alleviate divergence issues in an adversarial semantic segmentation setting and results in considerable performance improvements (+5% in some classes) on the baseline for three standard datasets.

📄 PDF Abstract BibTeX arXiv:2006.11227

Code (0)

등록된 구현이 없습니다.

Tasks

Real-Time Semantic SegmentationSegmentationSemantic Segmentation

Similar Papers 제목 키워드 기반

Characterizing Lookahead Dynamics of Smooth Games

2021-01-01 · Junsoo Ha, Gunhee Kim

As multi-agent systems proliferate in machine learning research, games have attracted much attention as a framework to understand optimization of multiple interacting objectives. However, a key challenge in game optimiza…

Stable Nonconvex-Nonconcave Training via Linear Interpolation

2023-10-20 · NeurIPS 2023 11 · Thomas Pethick, Wanyun Xie, Volkan Cevher

This paper presents a theoretical analysis of linear interpolation as a principled method for stabilizing (large-scale) neural network training. We argue that instabilities in the optimization process are often caused by…

Lookahead identification in adversarial bandits: accuracy and memory bounds

2026-02-28 · Nataly Brukhim, Nicolò Cesa-Bianchi, Carlo Ciliberto arxiv

We study an identification problem in multi-armed bandits. In each round a learner selects one of $K$ arms and observes its reward, with the goal of eventually identifying an arm that will perform best at a {\it future} …

Multi-Armed Bandits

Limited Lookahead in Imperfect-Information Games

2019-02-17 · Christian Kroer, Tuomas Sandholm

Limited lookahead has been studied for decades in perfect-information games. We initiate a new direction via two simultaneous deviation points: generalization to imperfect-information games and a game-theoretic approach.…

Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search

2025-06-24 · Seunghun Lee, Jihong Park, Jinho Choi, HyunCheol Park

Tokens are fundamental processing units of generative AI (GenAI) and large language models (LLMs), and token communication (TC) is essential for enabling remote AI-generate content (AIGC) and wireless LLM applications. U…