Concept Graph & Resume using Claude 3.5 Sonnet | Chat GPT4o | Llama 3:
Resume:
1.- Causal fairness: Algorithmic fairness definitions based on causal reasoning about the effects of protected attributes and decisions on outcomes.
2.- Counterfactual equalized odds: Requires equal true/false positive rates across groups in counterfactual scenarios where decisions are altered.
3.- Conditional principal fairness: Decisions should be independent of protected attributes given potential outcomes and reduced covariates.
4.- Path-specific fairness: Limits effects of protected attributes on decisions along certain causal paths while allowing effects along others.
5.- Counterfactual predictive parity: Among rejected applicants, proportion who would have succeeded if accepted should be equal across groups.
6.- Utility-maximizing policies: Decision policies that maximize a utility function while satisfying fairness constraints and budget limitations.
7.- Pareto dominance: A policy Pareto dominates another if it's preferred by all decision makers with a certain class of utility functions.
8.- Prevalence: Generalizes "full measure" sets to infinite-dimensional spaces, used to characterize generic properties of probability distributions.
9.- U-fine distributions: Probability distributions where utilities have a density, avoiding issues with atoms in the utility distribution.
10.- Threshold policies: Decision rules that accept individuals above a threshold value of utility.
11.- Multiple threshold policies: Decision rules with group-specific thresholds on utility.
12.- Budget-exhausting policies: Decision rules that use the full available budget (e.g. admit the maximum allowed number of students).
13.- Consistent utilities: A set of utility functions that agree on the sign and relative ordering of utilities within groups.
14.- Overlapping utilities: When a non-trivial threshold policy results in some positive decisions within each stratum of reduced covariates.
15.- Splitting utilities: When a threshold policy results in all positive or all negative decisions within each stratum of reduced covariates.
16.- Counterfactuals: Potential outcomes under hypothetical scenarios, like outcomes if decisions or protected attributes were different.
17.- Path-specific counterfactuals: Outcomes when intervening on protected attributes only along certain causal paths.
18.- Structural equations: Mathematical functions defining causal relationships between variables in a causal model.
19.- Causal DAG: Directed acyclic graph representing causal relationships between variables.
20.- Total variation norm: Metric for comparing probability measures, used to define convergence of measures.
21.- Pushforward measure: Measure induced on the output space by applying a function to a measure on the input space.
22.- Radon-Nikodym derivative: Density of one measure with respect to another, used to define densities of probability distributions.
23.- Absolute continuity: Property where one measure assigns zero to any set assigned zero by another measure.
24.- Universal measurability: Sets measurable under all finite Borel measures, used to define shy sets.
25.- Shy sets: Generalization of measure zero sets to infinite-dimensional spaces.
26.- Probe: Finite-dimensional subspace used to detect shy sets.
27.- Markov chains: Mathematical systems transitioning between states with probabilities depending only on the current state.
28.- Recurrent classes: Sets of states in a Markov chain that the system eventually gets trapped in.
29.- Beta distribution: Continuous probability distribution defined on the interval [0,1], used to model utilities in examples.
30.- Infra-marginality: Issue where group differences persist even after equalizing decision rates due to within-group heterogeneity.
Knowledge Vault built byDavid Vivancos 2024