홈 › Papers

Reinforcement Learning with Chromatic Networks for Compact Architecture Search

2019-07-10 · Xingyou Song, Krzysztof Choromanski, Jack Parker-Holder, Yunhao Tang, Wenbo Gao, Aldo Pacchiano, Tamas Sarlos, Deepali Jain, Yuxiang Yang

We present a neural architecture search algorithm to construct compact reinforcement learning (RL) policies, by combining ENAS and ES in a highly scalable and intuitive way. By defining the combinatorial search space of NAS to be the set of different edge-partitionings (colorings) into same-weight classes, we represent compact architectures via efficient learned edge-partitionings. For several RL tasks, we manage to learn colorings translating to effective policies parameterized by as few as $17$ weight parameters, providing >90% compression over vanilla policies and 6x compression over state-of-the-art compact policies based on Toeplitz matrices, while still maintaining good reward. We believe that our work is one of the first attempts to propose a rigorous approach to training structured neural network architectures for RL problems that are of interest especially in mobile robotics with limited storage and computational resources.

📄 PDF Abstract BibTeX arXiv:1907.06511

Code (0)

등록된 구현이 없습니다.

Tasks

Combinatorial OptimizationNeural Architecture Search reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)

Methods 이 논문이 사용한 방법론

Sigmoid Activation 설명 없음

Tanh Activation 설명 없음

Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…

LSTM An LSTM is a type of recurrent neural network that addresses the vanishing gradient problem in vanilla…

Reinforcement Learning with Chromatic Networks

2019-09-25 · Xingyou Song, Krzysztof Choromanski, Jack Parker-Holder, Yunhao Tang 외

Neural Architecture Search reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)

Reinforcement Learning the Chromatic Symmetric Function

2024-10-24 · Gergely Bérczi, Jonas Klüver

We propose a conjectural counting formula for the coefficients of the chromatic symmetric function of unit interval graphs using reinforcement learning. The formula counts specific disjoint cycle-tuples in the graphs, re…

reinforcement-learning Reinforcement Learning

ChromouVQA: Benchmarking Vision-Language Models under Chromatic Camouflaged Images

2025-11-30 · Yunfei Zhang, Yizhuo He, Yuanxun Shao, Zhengtao Yao 외 arxiv

Vision-Language Models (VLMs) have advanced multimodal understanding, yet still struggle when targets are embedded in cluttered backgrounds requiring figure-ground segregation. To address this, we introduce ChromouVQA, a…

Spatial Reasoning

Invariant properties of a locally salient dither pattern with a spatial-chromatic histogram

2018-02-28 · A. M. R. R. Bandara, L. Ranathunga, N. A. Abdullah

Compacted Dither Pattern Code (CDPC) is a recently found feature which is successful in irregular shapes based visual depiction. Locally salient dither pattern feature is an attempt to expand the capability of CDPC for b…

SAFE: Scene-Aware Feature Modulation for Color Constancy with Learned Color Space in Pure-Color Scenes

2026-08-14 · Yuan-Kang Lee, Kuan-Lin Chen, Chih-Heng Chang, Jian-Jiun Ding arxiv

Color constancy on pure-color scenes is challenging: when most pixels share a narrow band of hues, every chromaticity-based cue collapses to a single point and standard estimators become ambiguous. We propose a compact f…

Color Constancy