{"id":"paperswithcode-paper-1806.01059","name":"ifair-learning-individually-fair-data-representations-for-algorithmic-de-1806.01059","tags":["paperswithcode-import","external-catalog","paperswithcode","paper","Decision Making","Fairness","Learning-To-Rank"],"task":"evaluation","type":"collection","evals":[],"owner":"paperswithcode","stars":0,"formats":["paperswithcode","paper","json","pdf-link"],"hosting":{"status":"blocked","storageProvider":"local","hostedFiles":0,"totalFiles":0,"hostedFilesAuthority":"live-serve-decision","hosted":false,"downloadable":false,"readyFileCount":0,"serveAuthority":"live-serve-decision","completeRunnable":false,"authority":"postgres-executable-state-snapshot","authorityDigest":null,"downloadReady":false,"mirroredFiles":0,"mirroredBytes":0,"runReady":false,"verified":false},"license":"cc-by-sa-4.0-metadata","summary":"iFair: Learning Individually Fair Data Representations for Algorithmic Decision Making","version":"1806.01059","modality":"paper","upstream":{"gated":false,"tasks":["Decision Making","Fairness","Learning-To-Rank"],"pdfUrl":"http://arxiv.org/pdf/1806.01059v2.pdf","repoId":"paper:1806.01059","arxivId":"1806.01059","authors":["Preethi Lahoti","Krishna P. Gummadi","Gerhard Weikum"],"methods":[],"private":false,"repoUrl":"https://paperswithcode.com/paper/ifair-learning-individually-fair-data","disabled":false,"provider":"paperswithcode","repoType":"paper","revision":"https://paperswithcode.com/paper/ifair-learning-individually-fair-data","fetchedAt":"2026-07-01T20:30:24.907Z","conference":"","importMode":"external-catalog","licenseRaw":"cc-by-sa-4.0-metadata","openreviewId":"","archiveDataset":"pwc-archive/papers-with-abstracts"},"versions":[{"commit":"https://paperswithcode.com/paper","version":"1806.01059","releasedAt":"2018-06-04T00:00:00.000Z","scanStatus":"pending","manifestDigest":"external-not-mirrored"}],"citations":0,"createdAt":"2018-06-04T00:00:00.000Z","framework":"paperswithcode","publisher":"Papers with Code","sizeBytes":1,"sourceUrl":"https://paperswithcode.com/paper/ifair-learning-individually-fair-data","updatedAt":"2018-06-04T00:00:00.000Z","scanStatus":"pending","visibility":"public","description":"External Papers with Code paper metadata for 1806.01059. People are rated and ranked, towards algorithmic decision making in an increasing number of applications, typically based on machine learning. Research on how to incorporate fairness into such tasks has prevalently pursued the paradigm of group fairness: giving adequate success rates to specifically protected groups. In contrast, the alternative paradigm of individual fairness has received relatively little attention, and this paper advances this less explored direction. The paper introduces a method for probabilistically mapping user records into a low-rank representation that reconciles individual fairness and the utility of classifiers and rankings in downstream applications. Our notion of individual fairness requires that users who are similar in all task-relevant attributes such as job qualification, and disregarding all potentially discriminating attributes such as gender, should have similar outcomes. We demonstrate the versatility of our method by applying it to classification and learning-to-rank tasks on a variety of real-world datasets. Our experiments show substantial improvements over the best prior work for this setting. Tasks: Decision Making, Fairness, Learning-To-Rank. Hugging Bay stores this as research and task metadata only; papers, PDFs, and code remain upstream.","mirrorCount":0,"safetyNotes":["External metadata imported from paperswithcode on 2026-07-01T20:30:24.907Z.","This record is searchable and linkable, but Hugging Bay does not host its files.","Use the upstream source URL until a source-specific legal and mirror review approves local hosting."],"releaseGates":{"scan":"pending","files":"pending","license":"pending","metadata":"passed","signature":"pending","provenance":"passed"},"downloadCount":3,"cardCompleteness":92,"verificationStatus":"pending","requestedVisibility":"public","repo":"paperswithcode/ifair-learning-individually-fair-data-representations-for-algorithmic-de-1806.01059","files":[],"fileCount":0,"hostedFileCount":0,"externalFileCount":0,"communityReviewSummary":{"count":0,"averageRating":0,"verifiedRuns":0,"selfReportedVerifiedRuns":0,"verificationQualification":"quarantined-untrusted-evidence","verificationTrustImpact":"none","helpfulCount":0,"reportCount":0,"reportedReviews":0,"distribution":{"1":0,"2":0,"3":0,"4":0,"5":0},"toolCounts":{},"categoryAverages":{},"categoryCounts":{},"benchmarkEvidence":{"count":0,"verifiedCount":0,"benchmarkCount":0,"performanceCount":0,"hardwareCounts":{},"topMetrics":[],"recent":[]},"recent":[]},"publicDownloadableFileCount":0,"publicFileCount":0,"displayOnly":true,"authorizationRequired":true,"eligibilitySnapshotAt":"2026-11-21T23:22:18.913Z","webUrl":"https://huggingbay.xyz/artifact/paperswithcode-paper-1806.01059","listedFileLowerBound":0,"hostingStatus":"blocked","signals":{"size":{"known":false,"bytes":0,"label":"unknown","reason":"upstream file sizes are not indexed yet"},"demand":{"mirrorRequests":0,"upstreamDownloads":3,"upstreamStars":0,"label":"3 upstream downloads","basis":"upstream-downloads"},"trust":{"score":0,"level":"unknown","label":"Unknown","qualification":"recorded-state-unknown","trustImpact":"none","checks":[{"id":"license","label":"License","status":"fail","detail":"cc-by-sa-4.0-metadata"},{"id":"provenance","label":"Provenance","status":"pass","detail":"paper:1806.01059"},{"id":"scan","label":"Scan","status":"warn","detail":"pending"},{"id":"hosting","label":"Hosted files","status":"warn","detail":"external metadata only"},{"id":"manifest","label":"Byte manifest integrity","status":"warn","detail":"not final yet"}],"strengths":["Provenance: paper:1806.01059"],"gaps":["License: cc-by-sa-4.0-metadata","Scan: pending","Hosted files: external metadata only","Byte manifest integrity: not final yet"]},"readiness":{"score":0,"level":"unknown","hostedFinal":false,"hostedFiles":0,"externalFiles":0,"totalFiles":0},"action":{"id":"open-source","label":"Open official source","detail":"Use the official immutable source while Hugging Bay evidence remains incomplete.","href":"https://paperswithcode.com/paper/ifair-learning-individually-fair-data"}},"mirrorCompletion":{"status":"external","hostedFiles":0,"totalFiles":0,"externalFiles":0,"hostedBytes":0,"externalBytes":1,"lowRiskExternalFiles":0,"overFileCapFiles":0,"overBatchCapFiles":0,"directMirrorExternalFiles":0,"directMirrorExternalBytes":0,"currentLimits":{"maxMirrorFileBytes":536870912,"maxMirrorTotalBytes":1073741824,"maxMirrorFiles":8,"maxDirectMirrorFileBytes":8589934592,"maxDirectMirrorTotalBytes":17179869184},"directMirrorExternalSamples":[],"largestExternalFiles":[]},"licenseLabel":"cc-by-sa-4.0-metadata","licenseState":"known","recommendedFile":null,"modelSizeTruth":true,"torrent":null,"torrentUrl":null,"magnetUri":null,"downloadUrl":null,"landingUrl":null,"manifestUrl":null,"localKitUrl":null,"licenseClarity":{"license":"cc-by-sa-4.0-metadata","commercialUse":"conditional","confidence":"high","obligations":["Credit the creator, retain the copyright and license notice, link the license, and indicate whether changes were made.","Distribute adaptations under the same license (or a license the original license permits as compatible)."],"summary":"cc-by-sa-4.0-metadata: commercial use is permitted with attribution; adaptations must use the same or a permitted compatible license.","redistribution":"Credit the creator, retain the copyright and license notice, link the license, and indicate whether changes were made. Distribute adaptations under the same license (or a license the original license permits as compatible).","notes":"Not legal advice."},"licenseObligationsDigest":null,"licenseUpstreamRecord":{"declaredLicense":"cc-by-sa-4.0-metadata","upstreamLicenseRaw":"cc-by-sa-4.0-metadata","sourceUrl":"https://paperswithcode.com/paper/ifair-learning-individually-fair-data","upstream":{"gated":false,"tasks":["Decision Making","Fairness","Learning-To-Rank"],"pdfUrl":"http://arxiv.org/pdf/1806.01059v2.pdf","repoId":"paper:1806.01059","arxivId":"1806.01059","authors":["Preethi Lahoti","Krishna P. Gummadi","Gerhard Weikum"],"methods":[],"private":false,"repoUrl":"https://paperswithcode.com/paper/ifair-learning-individually-fair-data","disabled":false,"provider":"paperswithcode","repoType":"paper","revision":"https://paperswithcode.com/paper/ifair-learning-individually-fair-data","fetchedAt":"2026-07-01T20:30:24.907Z","conference":"","importMode":"external-catalog","licenseRaw":"cc-by-sa-4.0-metadata","openreviewId":"","archiveDataset":"pwc-archive/papers-with-abstracts"}},"gateStatus":"ungated","downloadable":false,"downloadStatus":"BLOCKED","reasonCodes":["incomplete-manifest","no-tested-run-plan","unverified-bytes"],"reason":"Files withheld — not faked. This model is listed, but we haven't confirmed its download files, so no download URLs are published. What's missing: file manifest — not final; downloadable files — 0 confirmed; run plan — not tested.","serveEvaluatedAt":"2026-11-21T23:23:08.521Z","serveEvaluationId":"serve-d7bd14fffd2d9a58042e383f851492753c92658dfaf02d4492026c71a011c7cf","readiness":"blocked","downloadReady":false,"mirroredBytes":0,"readinessCheckedAt":"2026-11-21T23:23:08.655Z","readinessSource":"file-check","serveExplanation":{"downloadable":false,"downloadStatus":"BLOCKED","reasonCodes":["incomplete-manifest","no-tested-run-plan","unverified-bytes"],"reason":"Files withheld — not faked. This model is listed, but we haven't confirmed its download files, so no download URLs are published. What's missing: file manifest — not final; downloadable files — 0 confirmed; run plan — not tested.","serveEvaluatedAt":"2026-11-21T23:23:08.521Z","serveEvaluationId":"serve-d7bd14fffd2d9a58042e383f851492753c92658dfaf02d4492026c71a011c7cf","readiness":"blocked","downloadReady":false,"hostedFileCount":0,"mirroredBytes":0,"readinessCheckedAt":"2026-11-21T23:23:08.521Z","readinessSource":"file-check","degraded":false,"stale":false},"commandsAvailable":false,"runReady":false,"attribution":"Cataloged open AI model · https://huggingbay.xyz/artifact/paperswithcode-paper-1806.01059","decentralizedDistribution":{"protocol":"bittorrent-magnet-metadata","verifiedFallbacks":0,"pendingReviewRequests":0,"reviewRequired":true,"policy":"Peer-assisted fallbacks are metadata only until Hugging Bay review confirms source, license, provenance, and safety. Gated/private bypasses are not allowed."},"hosted":false,"modelState":{"state":"not_hosted","word":"Not hosted here","sentence":"Files are not hosted here yet. Open the model to ask for them."},"pageFacts":{"id":"paperswithcode-paper-1806.01059","repo":"paperswithcode/ifair-learning-individually-fair-data-representations-for-algorithmic-de-1806.01059","type":"collection","purpose":"collection artifact for evaluation","license":{"id":"cc-by-sa-4.0-metadata","label":"cc-by-sa-4.0-metadata","state":"known","url":"https://spdx.org/licenses/CC-by-sa-4.0-metadata.html","source":"spdx","hostedFile":false,"commercialUse":"conditional","terms":"cc-by-sa-4.0-metadata: commercial use is permitted with attribution; adaptations must use the same or a permitted compatible license."},"task":{"id":"evaluation","label":"evaluation"},"size":{"bytes":0,"label":"unknown","known":false,"repositoryLabel":"Full repo upstream","hostedKnown":false,"hostedBytes":0,"hostedLabel":"size unknown","hostedSummary":"availability unknown","hostedIsSubset":false,"downloadBytes":0,"downloadLabel":"","recommended":null,"parameters":null,"sentence":"Hosted here: availability unknown. The full repository size is not recorded."},"files":{"hosted":0,"total":0,"label":"0 hosted of 0 listed"},"download":{"status":"blocked","gated":"serve","label":"Downloadable files: 0 confirmed","url":""},"released":{"iso":"2018-06-04","label":"Jun 4, 2018","upstream":true,"factLabel":"Released"},"updated":{"iso":"2018-06-04","label":"Jun 4, 2018","factLabel":"Updated at source"},"source":{"provider":"paperswithcode","label":"paperswithcode","url":"https://paperswithcode.com/paper/ifair-learning-individually-fair-data","repoId":"paper:1806.01059"},"languages":[],"baseModel":{"ref":"","url":"","resolveUrl":""},"paperIds":[],"arxivIds":[],"sameAs":["https://paperswithcode.com/paper/ifair-learning-individually-fair-data"],"creator":{"@type":"Organization","name":"Papers with Code"},"scholarlyArticles":[],"scanStatus":"pending","faq":[{"id":"what-is-it","question":"What is paperswithcode/ifair-learning-individually-fair-data-representations-for-algorithmic-de-1806.01059?","answer":"paperswithcode/ifair-learning-individually-fair-data-representations-for-algorithmic-de-1806.01059 is a collection artifact for evaluation published by Papers with Code, released Jun 4, 2018. iFair: Learning Individually Fair Data Representations for Algorithmic Decision Making"},{"id":"license","question":"What license does paperswithcode/ifair-learning-individually-fair-data-representations-for-algorithmic-de-1806.01059 use, and can I use it commercially?","answer":"It is released under the cc-by-sa-4.0-metadata license. Commercial use is allowed with conditions. cc-by-sa-4.0-metadata: commercial use is permitted with attribution; adaptations must use the same or a permitted compatible license."},{"id":"size","question":"How big is paperswithcode/ifair-learning-individually-fair-data-representations-for-algorithmic-de-1806.01059?","answer":"Hosted here: availability unknown. The full repository size is not recorded."},{"id":"download","question":"Where can I download paperswithcode/ifair-learning-individually-fair-data-representations-for-algorithmic-de-1806.01059?","answer":"This model is listed, but we haven't confirmed its download files, so we won't offer a download button we can't stand behind. The record lists 0 files."},{"id":"safety","question":"Has paperswithcode/ifair-learning-individually-fair-data-representations-for-algorithmic-de-1806.01059 been scanned for unsafe files?","answer":"Source scan status: pending. A scan checks the files for known-bad signatures; it does not mean the model is safe. The machine-readable verdict is at /api/artifacts/paperswithcode-paper-1806.01059/safety on Hugging Bay."},{"id":"fit-unknown","question":"Will paperswithcode/ifair-learning-individually-fair-data-representations-for-algorithmic-de-1806.01059 run on my computer?","answer":"We can’t check the fit; we don’t know your machine. We don’t have your machine’s specs, so no check ran and no verdict is shown. Answer two quick questions and we’ll estimate, from the memory you tell us, whether it fits your machine. Or skip it; you can still download; fit isn’t checked."}]},"guidedDownloadCard":{"schemaVersion":"hugging-bay.guided-download-card/v2","artifactId":"paperswithcode-paper-1806.01059","repo":"paperswithcode/ifair-learning-individually-fair-data-representations-for-algorithmic-de-1806.01059","serveState":"BLOCKED","downloadReady":false,"reasonCodes":["manifest_not_final","files_unconfirmed","run_plan_untested"],"withheld":{"active":true,"reasonCodes":["manifest_not_final","files_unconfirmed","run_plan_untested"]},"wasmRun":null,"bytesOnStorage":false,"file":null,"noHostedWeights":true,"notSingleFile":false,"download":{"available":false,"url":null},"otherFiles":[],"run":{"available":false,"reason":"no-runnable-file","lmStudioUrl":"https://lmstudio.ai/","terminalCommand":null,"verificationMessage":null},"paused":{"active":false},"blocked":{"active":true,"reason":"page-facts-not-hosted","message":"Files withheld. Not faked."},"unconfirmed":{"active":false},"licenseGate":{"active":false},"checks":{"license":null,"licenseLabel":null,"fingerprintMatches":false,"hostedFiles":0,"totalFiles":0},"policyVersion":"hugging-bay.guided-download-card/v2","evaluatedAt":"2026-11-21T23:23:08.660Z","readiness":"blocked","downloadable":false,"downloadStatus":"BLOCKED","hostedFileCount":0,"mirroredBytes":0,"readinessCheckedAt":"2026-11-21T23:23:08.660Z","readinessSource":"file-check","degraded":false,"stale":false,"hosted":false,"hostingStatus":"blocked","publicDownloadableFileCount":0,"serve_verdict":{"can_download":false,"bytes_verified":false,"signature":"unsigned","freshness":"current","checked_at":"2026-11-21T23:23:08.660Z","evidence_url":"/api/manifests/paperswithcode-paper-1806.01059"}},"howToRun":{"schema":"hugging-bay.how-to-run.v1","available":false,"runtime":null,"command":null,"file":null,"minimumRamGb":null,"downloadUrl":null,"downloadCommand":null,"verifyCommand":null,"downloadUrlNote":"Stable URL. Each GET re-checks the file and redirects to a signed link that lasts at most 300 seconds; open it again for a fresh link.","filesUrl":"https://huggingbay.xyz/api/v1/artifacts/paperswithcode-paper-1806.01059/files","tested":false,"note":"No single hosted file is recorded for this model yet. minimumRamGb is an estimate from the file size (file at most 0.6 x memory), not a measurement."},"canIRun":true,"runTested":false,"degraded":false,"stale":false,"contentControls":{"state":"not assessed","basis":"no_explicit_uploader_evidence","matchedTerms":[],"assessedAt":null},"contentControlsLabel":"Content controls: not assessed.","contentControlsAttribution":{"upstream":{"provider":"paperswithcode","repoId":"paper:1806.01059"}},"runs_here":{"schema_version":1,"artifact_id":"paperswithcode-paper-1806.01059","records":[],"next_cursor":null},"hardware_fit":{"schema":"hugging-bay.hardware-fit.v1","artifactId":"paperswithcode-paper-1806.01059","revision":"","claim":"estimated_physical_memory_capacity","runnableAuthority":false,"representations":[],"reason":"immutable_revision_unavailable"},"note":{"summary":"Downloadable doesn't mean tested: this record says whether the exact file can be downloaded now, not that the model is complete or that it runs.","downloadable":false},"serve_verdict":{"can_download":false,"bytes_verified":false,"signature":"unsigned","freshness":"current","checked_at":"2026-11-21T23:23:08.655Z","evidence_url":"/api/manifests/paperswithcode-paper-1806.01059"}}