Scalable Base Station Configuration via Bayesian Optimization with Block Coordinate Descent
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866908839590232064 |
|---|---|
| author | Takamori, Kakeru Sato, Koya |
| author_facet | Takamori, Kakeru Sato, Koya |
| contents | This paper proposes a scalable Bayesian optimization (BO) framework for dense base-station (BS) configuration design. BO can find an optimal BS configuration by iterating parameter search, channel simulation, and probabilistic modeling of the objective function. However, its performance is severely affected by the curse of dimensionality, thereby reducing its scalability. To overcome this limitation, the proposed method sequentially optimizes per-BS parameters based on block coordinate descent while fixing the remaining BS configurations, thereby reducing the effective dimensionality of each optimization step. Numerical results demonstrate that the proposed approach significantly outperforms naive optimization in dense deployment scenarios. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_16378 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Scalable Base Station Configuration via Bayesian Optimization with Block Coordinate Descent Takamori, Kakeru Sato, Koya Information Theory Networking and Internet Architecture This paper proposes a scalable Bayesian optimization (BO) framework for dense base-station (BS) configuration design. BO can find an optimal BS configuration by iterating parameter search, channel simulation, and probabilistic modeling of the objective function. However, its performance is severely affected by the curse of dimensionality, thereby reducing its scalability. To overcome this limitation, the proposed method sequentially optimizes per-BS parameters based on block coordinate descent while fixing the remaining BS configurations, thereby reducing the effective dimensionality of each optimization step. Numerical results demonstrate that the proposed approach significantly outperforms naive optimization in dense deployment scenarios. |
| title | Scalable Base Station Configuration via Bayesian Optimization with Block Coordinate Descent |
| topic | Information Theory Networking and Internet Architecture |
| url | https://arxiv.org/abs/2602.16378 |