Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

306090120 · Jun 202019922001200920172026
48 results for attribute privacy

Paper develops methods for fair insurance pricing without direct access to sensitive attributes.

problem Fairness in insurance pricing with restricted access to sensitive attributes.
method Develops statistical methods for estimating discrimination-free premiums using privatized sensitive attributes.
result The proposed methods enable fair insurance pricing while respecting privacy and regulatory constraints.

Estimates conversion probabilities from click sequences with privacy constraints.

problem Training models in advertising with limited direct click-conversion links.
method Formalizes learning from attribution sets, constructs unbiased estimator, applies Empirical Risk Minimization.
result Empirical Risk Minimization achieves generalization guarantees and robustness against prior errors.

"Overlearning" means that a model trained for a seemingly simple objective implicitly learns to recognize attributes and concepts that are (1) not part of the learning objective, and (2) sensitive from a privacy or bias perspective. For example, a binary gender classifier of facial images also learns to recognize races…

2019-05-28abs ↗pdf ↗

Optimal LDP mechanisms reduce data unfairness in classification.

problem Reducing data unfairness in classification models.
method Developed a closed-form optimal mechanism for binary attributes and a tractable framework for multi-valued attributes.
result Optimal LDP mechanisms improve fairness in classification while maintaining accuracy close to non-private models.

CDA framework infers channel influence from aggregated data without user identifiers.

problem Lack of user-level path data due to privacy regulations and platform restrictions.
method CDA integrates PCMCI for causal discovery and Structural Causal Model for effect estimation.
result CDA achieves strong accuracy in estimating channel influence, even under structural uncertainty.

Unified framework analyzes privacy risks from gradients in distributed learning.

problem Analyzing inference privacy risks from gradients in machine learning.
method Unified game-based framework for various attacks, including attribute, property, distributional, and user disclosures.
result Demonstrates inefficacy of data aggregation for privacy against inference attacks.

Graphs are widely adopted for modeling complex systems, including financial, biological, and social networks. Nodes in networks usually entail attributes, such as the age or gender of users in a social network. However, real-world networks can have very large size, and nodal attributes can be unavailable to a number of…

2018-12-03abs ↗pdf ↗

New credit attribution methods for machine learning models using relaxed stability guarantees.

problem Ensuring proper attribution in generative models trained on existing works.
method Proposed new definitions of stability that allow for non-stable processing of a subset of datapoints with permission.
result Extended well-studied stability notions and provided a comprehensive characterization of learnability.

Researchers found PP-GANs can hide sensitive data in sanitized images, undermining privacy checks.

problem Lack of formal proofs of privacy in PP-GANs for image sanitization.
method Subverted PP-GANs for facial expression recognition to hide sensitive data in sanitized images.
result It is possible to hide sensitive identification data in sanitized PP-GAN output images, even allowing reconstruction of entire input images.

We present a framework to learn privacy-preserving encodings of images that inhibit inference of chosen private attributes, while allowing recovery of other desirable information. Rather than simply inhibiting a given fixed pre-trained estimator, our goal is that an estimator be unable to learn to accurately predict th…

2018-02-14abs ↗pdf ↗

This work proposes a novel privacy-preserving method for synthetic replacement of sensitive data.

problem Privacy-preserving transformations of sensitive data.
method Adversarial representation learning for synthetic replacement of private attributes.
result Our method provides stronger privacy and better utility than previous methods.

A privacy-preserving method for transmitting data over a wiretap channel using generative networks.

problem Privacy protection in communication over a wiretap channel.
method Data-driven approach using variational autoencoder (VAE)-based joint source channel coding (JSCC).
result The approach provides high reconstruction quality at the receiver while confusing the eavesdropper about the latent sensitive attribute.

Noise injection improves inference privacy in DNN models.

problem Malicious servers can infer sensitive attributes from input data.
method Adaptive Noise Injection (ANI) using a lightweight DNN on the client.
result Significant improvement in privacy (up to 48.5% degradation in sensitive-task accuracy with <1% degradation in primary accuracy).

BUDS balances privacy and utility by shuffling data, achieving strong privacy with minimal loss.

problem Balancing privacy and utility in crowd-sourced statistical databases.
method One-hot encoding, iterative shuffling, loss estimation, risk minimization.
result Achieves ε=0.02ε= 0.02 for privacy, maintaining a privacy bound of ε=ln[t/((n11)S)]ε= ln [t/((n_1 - 1)^S)].

In many graphs such as social networks, nodes have associated attributes representing their behavior. Predicting node attributes in such graphs is an important problem with applications in many domains like recommendation systems, privacy preservation, and targeted advertisement. Attributes values can be predicted by a…

2019-12-27abs ↗pdf ↗

This study examines how model architecture affects deep learning model privacy.

problem Privacy concerns in deep learning models due to potential leakage of sensitive information.
method Investigation of CNNs and Transformers, focusing on activation layers, stem layers, LN layers, and attention modules.
result Transformers generally exhibit higher vulnerability to privacy attacks than CNNs.

Reduces risk of model inversion by reducing sensitive feature influence.

problem Model inversion attacks reveal sensitive individual data from trained models.
method Privacy-guided training to reduce sensitive feature influence in tree-based models.
result Training models to reduce sensitive feature influence reduces the risk of inference attacks.

TIPRDC anonymizes data features to protect privacy while retaining useful information.

problem Privacy concerns from crowdsourced data hinder deep learning applications.
method Hybrid training method combining adversarial and mutual information estimation.
result Feature extractor hides private information while preserving original data features.

Federated learning leaks participant dataset quality even with secure aggregation.

problem Leakage of participant dataset quality in federated learning with secure aggregation.
method Image recognition experiments to infer and attribute dataset quality.
result Relative quality ordering of participants can be inferred and used for various purposes.

Face recognition models can be inferred from student models, posing privacy risks.

problem Privacy threats in transfer learning models for face recognition.
method Membership inference attacks and attribute inference from aggregate-level information.
result Sensitive attributes can be inferred from student models, even with limited auxiliary information.

The paper explores how to measure and optimize ad reach while maintaining user privacy.

problem Measuring ad reach while preserving user privacy in online advertising.
method Introduces kk-anonymity and probabilistic discounting for frequency capping.
result Privacy introduces a significant performance drop but with manageable costs.

EIGAN learns private representations without centralized data, outperforming state-of-the-art.

problem Private representation learning with multiple ally and adversary attributes.
method Exclusion-Inclusion Generative Adversarial Network (EIGAN) and Distributed EIGAN (D-EIGAN).
result EIGAN and D-EIGAN outperform state-of-the-art methods in accuracy and scalability.

Proposes fair mapping to prevent bias in model predictions without distorting data.

problem Reduces bias in model predictions without altering the data distribution.
method Uses Wasserstein GAN and AttGAN frameworks to transform data distributions while preserving privacy and interpretability.
result Preserves data interpretability and fairness in subsequent analysis tasks.

Synthetic data improves credit scoring models' performance without compromising borrower privacy.

problem Scarcity of real data for credit scoring models due to privacy concerns.
method Privacy-preserving training with synthetic data.
result Credit scoring models trained with synthetic data show a reduction of 3% in AUC and 6% in KS compared to real data models.

Motivated by settings in which predictive models may be required to be non-discriminatory with respect to certain attributes (such as race), but even collecting the sensitive attribute may be forbidden or restricted, we initiate the study of fair learning under the constraint of differential privacy. We design two lear…

2018-12-06abs ↗pdf ↗

Proposes a method to enforce fairness in machine learning models without sensitive data.

problem Bias in machine learning models from historical data.
method Infers sensitive attributes from auxiliary features and integrates fairness constraints into model training.
result Mitigates bias while preserving predictive accuracy.

Optimal pre-processing reduces disparate impact by minimizing total variation distance.

problem Achieving fairness in data outputs based on protected attributes.
method Using pre-processing to enforce fairness, minimizing total variation distance between pre-processed and original data distributions.
result The problem of fairness can be formulated as a linear program, efficiently solvable.

Paper improves privacy-preserving measurement of advertising incrementality.

problem Privacy degradation in randomized lift tests for advertising measurement.
method Formulates a robust causal decision problem under signal losses, projecting clean worlds onto incrementality.
result Sharp decision frontier shows valid certification or rejection outside the frontier.

Study creates a multimodal learning framework for CVD risk prediction.

problem Predicting cardiovascular disease risk in diverse populations.
method Combines cross modal transformers, graph neural networks, and causal representation learning.
result Model predicts personalized CVD risk with causal invariance across subpopulations.

Most real-world data are scattered across different companies or government organizations, and cannot be easily integrated under data privacy and related regulations such as the European Union's General Data Protection Regulation (GDPR) and China' Cyber Security Law. Such data islands situation and data privacy & secur…

2019-05-24abs ↗pdf ↗