Imagen de Portada

From Pseudorandomness to Multi-Group Fairness and Back

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Dwork, Cynthia, Lee, Daniel, Lin, Huijia, Tankala, Pranay
Formato:	Preprint
Publicado:	2023
Materias:	Machine Learning Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Efficient and Private Property Testing via Indistinguishability
por: Dwork, Cynthia, et al.
Publicado: (2025)

Supersimulators
por: Dwork, Cynthia, et al.
Publicado: (2025)

Differentially Private Verification of Distribution Properties
por: Du, Elbert, et al.
Publicado: (2026)

From Fairness to Infinity: Outcome-Indistinguishable (Omni)Prediction in Evolving Graphs
por: Dwork, Cynthia, et al.
Publicado: (2024)

Differentially Private Learning Beyond the Classical Dimensionality Regime
por: Dwork, Cynthia, et al.
Publicado: (2024)

Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom
por: Grewal, Sabee, et al.
Publicado: (2022)

Distribution-Specific Auditing For Subgroup Fairness
por: Hsu, Daniel, et al.
Publicado: (2024)

Complexity-Theoretic Implications of Multicalibration
por: Casacuberta, Sílvia, et al.
Publicado: (2023)

Pseudorandomness, symmetry, smoothing: I
por: Derksen, Harm, et al.
Publicado: (2024)

Pseudorandomness, symmetry, smoothing: II
por: Derksen, Harm, et al.
Publicado: (2024)

Pseudorandom bits for non-commutative programs
por: Lee, Chin Ho, et al.
Publicado: (2025)

Marginal Fairness: Fair Decision-Making under Risk Measures
por: Huang, Fei, et al.
Publicado: (2025)

Algebraic Pseudorandomness in $VNC^0$
por: Andrews, Robert
Publicado: (2025)

Hidden costs for inference with deep network on embedded system devices
por: Lee, Chankyu, et al.
Publicado: (2026)

Pseudorandomness of Expander Walks via Fourier Analysis on Groups
por: Jeronimo, Fernando Granha, et al.
Publicado: (2025)

On the Hardness of Approximation of the Fair k-Center Problem
por: Thejaswi, Suhas
Publicado: (2026)

Polynomial-Time Optimal Group Selection via the Double-Commutator Eigenvalue Problem
por: Thornton, Mitchell A.
Publicado: (2026)

Reachability Constraints in Variational Quantum Circuits: Optimization within Polynomial Group Module
por: Oh, Yun-Tak, et al.
Publicado: (2026)

New Pseudorandom Generators and Correlation Bounds Using Extractors
por: Kumar, Vinayak M.
Publicado: (2025)

Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields
por: Dwivedi, Ashish, et al.
Publicado: (2024)

QMA vs. QCMA and Pseudorandomness
por: Liu, Jiahui, et al.
Publicado: (2024)

On the Expressive Power and Limitations of Multi-Layer SSMs
por: Zubić, Nikola, et al.
Publicado: (2026)

Proximity to Losslessly Compressible Parameters
por: Farrugia-Roberts, Matthew
Publicado: (2023)

On the Hardness of Learning Regular Expressions
por: Attias, Idan, et al.
Publicado: (2025)

Learnability of Parameter-Bounded Bayes Nets
por: Bhattacharyya, Arnab, et al.
Publicado: (2024)

A Little Depth Goes a Long Way: The Expressive Power of Log-Depth Transformers
por: Merrill, William, et al.
Publicado: (2025)

How Hard Is Continuous Clustering? Lower Bounds from the Existential Theory of the Reals
por: Majumdar, Angshul
Publicado: (2026)

Spiky Rank and Its Applications to Rigidity and Circuits
por: Hambardzumyan, Lianna, et al.
Publicado: (2026)

Rethinking the Role of Positional Encoding: Sliding-Window Transformers without PE Remain Turing Complete
por: Li, Qian, et al.
Publicado: (2026)

Low-Rank Matrix Approximation for Neural Network Compression
por: Cherukuri, Kalyan, et al.
Publicado: (2025)

Decision Tree Learning on Product Spaces
por: Moakahr, Arshia Soltani, et al.
Publicado: (2026)

Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers
por: Amiri, Alireza, et al.
Publicado: (2025)

Statistical and Computational Guarantees of Kernel Max-Sliced Wasserstein Distances
por: Wang, Jie, et al.
Publicado: (2024)

Fundamental Limits of Crystalline Equivariant Graph Neural Networks: A Circuit Complexity Perspective
por: Cao, Yang, et al.
Publicado: (2025)

A Logic for Expressing Log-Precision Transformers
por: Merrill, William, et al.
Publicado: (2022)

Smoothed Analysis for Learning Concepts with Low Intrinsic Dimension
por: Chandrasekaran, Gautam, et al.
Publicado: (2024)

Optimizing Computational-Statistical Runtime for Wasserstein Distance Estimation
por: Jacobs, Peter Matthew, et al.
Publicado: (2026)

Distribution-Specific Agnostic Conditional Classification With Halfspaces
por: Huang, Jizhou, et al.
Publicado: (2025)

Chain of Thought Empowers Transformers to Solve Inherently Serial Problems
por: Li, Zhiyuan, et al.
Publicado: (2024)

Ask, and it shall be given: On the Turing completeness of prompting
por: Qiu, Ruizhong, et al.
Publicado: (2024)