Copertina

An Efficient Hybridization of Graph Representation Learning and Metaheuristics for the Constrained Incremental Graph Drawing Problem

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Charytitsch, Bruna C. B., Nascimento, Mariá C. V.
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Machine Learning Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

An Efficient Learning-based Solver Comparable to Metaheuristics for the Capacitated Arc Routing Problem
di: Guo, Runze, et al.
Pubblicazione: (2024)

Conflict-Aware Seat Assignment in Classroom Environments
di: Charytitsch, Bruna Cristina Braga, et al.
Pubblicazione: (2026)

On Learning for Ambiguous Chance Constrained Problems
di: Madhusudanarao, A Ch, et al.
Pubblicazione: (2023)

Online Cluster-Based Parameter Control for Metaheuristic
di: Tatsis, Vasileios A., et al.
Pubblicazione: (2025)

Learning to Solve Optimization Problems Constrained with Partial Differential Equations
di: Guven, Yusuf, et al.
Pubblicazione: (2025)

Learning to Solve Constrained Bilevel Control Co-Design Problems
di: Kotary, James, et al.
Pubblicazione: (2025)

Efficient Graph Laplacian Estimation by Proximal Newton
di: Medvedovsky, Yakov, et al.
Pubblicazione: (2023)

Learning Graph Laplacian with MCP
di: Zhang, Yangjing, et al.
Pubblicazione: (2020)

Hybrid Reinforcement Learning Framework for Mixed-Variable Problems
di: Zhai, Haoyan, et al.
Pubblicazione: (2024)

Fast Algorithm for Constrained Linear Inverse Problems
di: Sheriff, Mohammed Rayyan, et al.
Pubblicazione: (2022)

Incremental Gradient Descent with Small Epoch Counts is Surprisingly Slow on Ill-Conditioned Problems
di: Kim, Yujun, et al.
Pubblicazione: (2025)

Incremental Learning of Sparse Attention Patterns in Transformers
di: Yüksel, Oğuz Kaan, et al.
Pubblicazione: (2026)

Incremental Gauss-Newton Descent for Machine Learning
di: Korbit, Mikalai, et al.
Pubblicazione: (2024)

Information Theoretically Optimal Sample Complexity of Learning Dynamical Directed Acyclic Graphs
di: Veedu, Mishfad Shaikh, et al.
Pubblicazione: (2023)

A Graph-Partitioning Based Continuous Optimization Approach to Semi-supervised Clustering Problems
di: Liu, Wei, et al.
Pubblicazione: (2025)

Near-Optimal Solutions of Constrained Learning Problems
di: Elenter, Juan, et al.
Pubblicazione: (2024)

Functionally Constrained Algorithm Solves Convex Simple Bilevel Problems
di: Zhang, Huaqing, et al.
Pubblicazione: (2024)

Surrogate-based Optimization via Clustering for Box-Constrained Problems
di: Ahmad, Maaz, et al.
Pubblicazione: (2026)

DNNLasso: Scalable Graph Learning for Matrix-Variate Data
di: Lin, Meixia, et al.
Pubblicazione: (2024)

Last Iterate Convergence of Incremental Methods and Applications in Continual Learning
di: Cai, Xufeng, et al.
Pubblicazione: (2024)

Learn2Aggregate: Supervised Generation of Chvátal-Gomory Cuts Using Graph Neural Networks
di: Deza, Arnaud, et al.
Pubblicazione: (2024)

FedGiA: An Efficient Hybrid Algorithm for Federated Learning
di: Zhou, Shenglong, et al.
Pubblicazione: (2022)

Assessing and Enhancing Graph Neural Networks for Combinatorial Optimization: Novel Approaches and Application in Maximum Independent Set Problems
di: Hu, Chenchuhui
Pubblicazione: (2024)

Convex Chance-Constrained Stochastic Control under Uncertain Specifications with Application to Learning-Based Hybrid Powertrain Control
di: Kato, Teruki, et al.
Pubblicazione: (2026)

humancompatible.train: Implementing Optimization Algorithms for Stochastically-Constrained Stochastic Optimization Problems
di: Kliachkin, Andrii, et al.
Pubblicazione: (2025)

PINNs in PDE Constrained Optimal Control Problems: Direct vs Indirect Methods
di: Zhang, Zhen, et al.
Pubblicazione: (2026)

Resilient Constrained Reinforcement Learning
di: Ding, Dongsheng, et al.
Pubblicazione: (2023)

A Novel Hybrid Heuristic-Reinforcement Learning Optimization Approach for a Class of Railcar Shunting Problems
di: Zhao, Ruonan, et al.
Pubblicazione: (2026)

Quotient-Categorical Representations for Bellman-Compatible Average-Reward Distributional Reinforcement Learning
di: Kaya, Ege C., et al.
Pubblicazione: (2026)

Graph Neural Networks for the Offline Nanosatellite Task Scheduling Problem
di: Pacheco, Bruno Machado, et al.
Pubblicazione: (2023)

Penalty-Based First-Order Methods for Bilevel Optimization with Minimax and Constrained Lower-Level Problems
di: Shen, Yiyang, et al.
Pubblicazione: (2026)

Sharpened Lazy Incremental Quasi-Newton Method
di: Lahoti, Aakash, et al.
Pubblicazione: (2023)

Near-optimal and Efficient First-Order Algorithm for Multi-Task Learning with Shared Linear Representation
di: Ding, Shihong, et al.
Pubblicazione: (2026)

A Stochastic-Gradient-based Interior-Point Algorithm for Solving Smooth Bound-Constrained Optimization Problems
di: Curtis, Frank E., et al.
Pubblicazione: (2023)

Sporadic Gradient Tracking over Directed Graphs: A Theoretical Perspective on Decentralized Federated Learning
di: Zehtabi, Shahryar, et al.
Pubblicazione: (2026)

Solving Integrated Process Planning and Scheduling Problem via Graph Neural Network Based Deep Reinforcement Learning
di: Li, Hongpei, et al.
Pubblicazione: (2024)

Training Deep Learning Models with Norm-Constrained LMOs
di: Pethick, Thomas, et al.
Pubblicazione: (2025)

Self-Supervised Learning of Iterative Solvers for Constrained Optimization
di: Lüken, Lukas, et al.
Pubblicazione: (2024)

Learning Constrained Optimization with Deep Augmented Lagrangian Methods
di: Kotary, James, et al.
Pubblicazione: (2024)

Combinatorial Causal Bandits without Graph Skeleton
di: Feng, Shi, et al.
Pubblicazione: (2023)