Energy Shields for Fairness
The paper titled 'Energy Shields for Fairness' introduces a novel approach to ensuring runtime fairness in decision-making processes. It presents energy shields as adaptive controllers that intervene probabilistically to maintain fairness over time. This method aims to provide both short-term safety and long-term liveness guarantees in fairness measures.
- ▪Energy shields are designed to monitor decision sequences and ensure fairness dynamically.
- ▪The intervention of energy shields is probabilistic, contrasting with traditional deterministic fairness shields.
- ▪The approach guarantees that fairness measures remain within specified target intervals over time.
arXiv cs.AI files mainly under ai research. We currently carry 1,128 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | arXiv cs.AI |
| Canonical URL | https://arxiv.org/abs/2605.24926 |
| Publication time | Tue, 26 May 2026 00:00:00 -0400 |
| Retrieval time | 2026-05-26T04:07:43.013Z |
| Last seen | 2026-05-26T04:07:43.013Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | X0cg34YIwc0Y |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
Computer Science > Artificial Intelligence arXiv:2605.24926 (cs) [Submitted on 24 May 2026] Title:Energy Shields for Fairness Authors:Filip Cano, Thomas A. Henzinger, Konstantin Kueffner View a PDF of the paper titled Energy Shields for Fairness, by Filip Cano and Thomas A. Henzinger and Konstantin Kueffner View PDF HTML (experimental) Abstract:Runtime fairness is not a one-time constraint but a dynamic property evaluated over a sequence of decisions. To ensure fairness at runtime, it is necessary to account for past decisions, information neglected by conventional, static classifiers. Traditional fairness shields enforce runtime fairness abruptly, by intervening \emph{deterministically} whenever a sequence of decisions violates the target for a running fairness measure.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at arXiv cs.AI.
Discussion
0 commentsMore from arXiv cs.AI
