arXiv AI
Jun 29
Unbiased Binning for Fairness-aware Attribute Representation
arXiv:2509. 21785v2 Announce Type: replace-cross Abstract: Discretizing raw features into bucketized attribute representations is a popular step before sharing a dataset.
Fair Minimum Labeling: Efficient Temporal Network Activations for Reachability and Equity
Related stories
Hugging Face Trending Papers
Sep 21
Dual-GNN Multilevel Coarsening for Maximum Independent Set
The maximum independent set (MIS) problem is a fundamental NP-hard combinatorial optimization problem with applications in scheduling, resource allocation, and network analysis. Exact solvers can prov...
arXiv Machine Learning
Jul 17
Low-Latency Relay Selection in NR-V2X Vehicular Communications via Graph Isomorphism Networks with Edge Features
arXiv:2607. 14176v1 Announce Type: new Abstract: Reliable, low-latency uplink connectivity is a key requirement for C-V2X networks in dense urban environments, where fast channel variations and blockages often degrade direct vehicle-to-infrastructure links.
arXiv Machine Learning
Jun 25
Learning Structural Hardness for Combinatorial Auctions: Instance-Dependent Algorithm Selection via Graph Neural Networks
arXiv:2602. 14772v2 Announce Type: replace Abstract: The Winner Determination Problem (WDP) in combinatorial auctions is NP-hard, and no existing method reliably predicts which instances will defeat fast greedy heuristics.
arXiv Machine Learning
Aug 14
TANGCO: Learning Topology-Aware Capacity Allocation for Overload-driven Cascading Failures
arXiv:2608. 13212v1 Announce Type: new Abstract: Networked systems, from power grids to traffic networks and cloud clusters, carry loads across nodes with limited capacity.
arXiv Machine Learning
Jun 9
Generalizing Fair Top-$k$ Selection: An Integrative Approach
arXiv:2603. 04689v3 Announce Type: replace-cross Abstract: Fair top-$k$ selection, which ensures appropriate proportional representation of members from minority or historically disadvantaged groups among the top-$k$ selected candidates, has drawn significant attention.
arXiv AI
Aug 25
Which Algorithms Can Graph Neural Networks Learn?
arXiv:2602.13106v2 Announce Type: replace-cross Abstract: In recent years, there has been growing interest in understanding neural architectures' ability to learn to execute discrete algorithms, a li...
arXiv AI
Aug 11
Dynamic Coalition Formation and Communication Pricing in Skill-Based Agentic AI Systems
arXiv:2608. 07532v1 Announce Type: new Abstract: Modern agentic AI systems combine multiple large language model agents with heterogeneous skills, yet most architectures either fix communication in advance or allow full broadcast.
arXiv Machine Learning
Aug 11
Beyond Binary: Continuous State Optimization with Graph-Structured Objectives
arXiv:2608. 09366v1 Announce Type: new Abstract: Large-scale learning systems often face the challenge of balancing multiple, potentially competing objectives, such as fairness, accuracy, and latency.
arXiv Machine Learning
Aug 4
Fairness in Augmented Graph Learning: A Survey
arXiv:2504. 21296v2 Announce Type: replace Abstract: Graph learning has evolved into Augmented Graph Learning (AGL) by integrating specialized machine learning (ML) techniques.
Hugging Face Trending Papers
Jul 14
Hierarchical $\mathcal{F}$-Clustering: Approximation and Hardness of Clustering into Trees and Bounded Diameter Graphs
Consider the following variation on the Hierarchical Clustering problem: Usually, while building a hierarchical clustering, one recursively partitions the data until each cluster becomes a singleton. We relax the halting condition of the recursive process to stop whenever the remaining cluster is a graph belonging to a class $\mathcal{F}$.
arXiv Machine Learning
Aug 10
Stream Learning: Partition-Fair Gossip Learning Without Tokens
arXiv:2608. 06946v1 Announce Type: cross Abstract: In gossip learning, a network of nodes trains a shared model collaboratively, without a central coordinator, by repeatedly exchanging parts of their local models.