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

106213319425 · Jun 202019922001200920172026
48 results for Membership Information

New method bounds membership inference attack success using mutual information.

problem Vulnerability of deep neural networks to membership inference attacks.
method Extended Fano's inequality to measure mutual information between inputs and activations.
result Empirical evaluation shows strong correlation between mutual information and model susceptibility.

Novel network model estimates mixed-membership structure with covariate information.

problem Estimating latent mixed-membership structure in networks with covariate information.
method Proposes a novel network model that incorporates both community information and node covariate similarities.
result Achieves optimal estimation accuracy for similarity matrix and mixed-membership.

Study shows membership inference requires many more samples than training data.

problem Membership inference attacks require more reference samples than training data.
method Investigated the sample complexity for membership inference in Gaussian mean estimation.
result Ω(n + n^2 ρ^2) samples are necessary for successful membership inference attacks.

Privacy and transparency are two key foundations of trustworthy machine learning. Model explanations offer insights into a model's decisions on input data, whereas privacy is primarily concerned with protecting information about the training data. We analyze connections between model explanations and the leakage of sen…

2019-06-29abs ↗pdf ↗

A new model integrates covariates with grade of membership analysis for better latent structure recovery.

problem Improving latent structure recovery in multivariate categorical data analysis.
method Covariate-assisted grade of membership model exploiting shared low-rank simplex geometry.
result Auxiliary covariates can provably improve latent structure recovery, leading to faster convergence rates.

The Mixed-Membership Stochastic Blockmodel~(MMSB) is proposed as one of the state-of-the-art Bayesian relational methods suitable for learning the complex hidden structure underlying the network data. However, the current formulation of MMSB suffers from the following two issues: (1), the prior information~(e.g. entiti…

2020-01-17abs ↗pdf ↗

We quantitatively investigate how machine learning models leak information about the individual data records on which they were trained. We focus on the basic membership inference attack: given a data record and black-box access to a model, determine if the record was in the model's training dataset. To perform members…

2016-10-18abs ↗pdf ↗

Regularization may not fully protect against membership inference attacks.

problem Mitigating membership inference attacks in deep learning models.
method Evaluation of 8 regularization mechanisms on three image classification tasks.
result Certain regularization mechanisms can inadvertently help membership inference attacks.

This paper proposes a discrimination technique for vertices in a weighted network. We assume that the edge weights and adjacencies in the network are conditionally independent and that both sources of information encode class membership information. In particular, we introduce a edge weight distribution matrix to the s…

2019-06-07abs ↗pdf ↗

In this paper we propose a new membership attack method called co-membership attacks against deep generative models including Variational Autoencoders (VAEs) and Generative Adversarial Networks (GANs). Specifically, membership attack aims to check whether a given instance x was used in the training data or not. A co-me…

2018-05-24abs ↗pdf ↗

New attacks show data augmentation may not improve privacy.

problem Measuring privacy risk in models trained with data augmentation.
method Formulated membership inference as a set classification problem, designed input permutation invariant features.
result Proposed approach universally outperforms original methods on models trained with data augmentation.

The paper proposes a new model to analyze directed networks and accurately estimate community memberships.

problem Modeling and estimating community memberships in directed networks with heterogeneous degrees.
method Directed Degree Corrected Mixed Membership (DiDCMM) model and DiMSC algorithm.
result The proposed DiMSC algorithm is asymptotically consistent and provides error bounds for community membership vectors.

Paper evaluates membership inference attacks on transfer learning models.

problem Evaluating membership inference attacks on transfer learning models.
method Shadow model training strategy to derive data for membership inference classifier.
result Membership inference attacks can achieve effective performance against transfer learning models.

DiMMSB models directed mixed membership networks, identifying distinct community structures.

problem Modeling directed mixed membership networks with distinct community structures.
method Directed Mixed Membership Stochastic Blockmodel (DiMMSB) with DiSP algorithm.
result DiSP algorithm is asymptotically consistent and outperforms competitors.

New research limits how well attackers can guess if data points were in a model's training set.

problem Revealing membership of data points in machine learning models.
method Theoretical analysis of statistical limits for membership inference attacks.
result The effectiveness of membership inference attacks is limited by a constant that quantifies data distribution diversity.

Proposes a new privacy notion for membership inference attacks on machine learning models.

problem Membership inference attacks on machine learning models.
method Introduces ff-Membership Inference Privacy (ff-MIP) and μμ-Gaussian Membership Inference Privacy (μμ-GMIP) to quantify and mitigate privacy risks.
result Analyzes likelihood ratio-based attacks and derives μμ-GMIP guarantees for stochastic gradient descent (SGD) models.

Robust fuzzy clustering for EEG driver alertness with outlier detection.

problem Ambiguous state boundaries in multivariate time series data.
method RFCPCA, a robust fuzzy subspace-clustering method for MTS.
result RFCPCA improves clustering accuracy and characterizes uncertainty and outliers in MTS.

The paper develops methods to infer membership probabilities and rank network nodes using the DCMM model.

problem Understanding the latent structure of network data, especially in mixed-membership models.
method Degree-Corrected Mixed Membership (DCMM) model, novel finite-sample expansion, asymptotic distributions, confidence intervals, multiplier bootstrap method.
result Valid inference on membership probabilities and node rankings, quantifying uncertainty.

A new LDA model with covariates for mixed-membership clusters.

problem Modeling mixed-membership clusters in discrete data with covariates.
method Negative binomial regression embedded within LDA, slice sampling within Gibbs sampling.
result Model successfully retrieves true parameter values and predicts cluster abundances using covariates.

New attacks can infer model training membership using only label predictions, not confidence.

problem Inferring whether a data point was used to train a machine learning model.
method Evaluate model's predicted labels under perturbations to infer membership.
result Label-only attacks perform as well as confidence-based attacks and break defenses that rely on confidence masking.

New framework tackles stochastic latent subgroup heterogeneity in online decision-making.

problem Stochastic latent heterogeneity in online decision-making where individual responses vary with unobserved subgroups.
method Latent heterogeneous bandit framework using EM-greedy algorithm to learn subgroup probabilities and reward parameters.
result Achieves optimal estimation and classification guarantees, revealing a fundamental stochastic barrier in online decision-making.

We use partial class memberships in soft classification to model uncertain labelling and mixtures of classes. Partial class memberships are not restricted to predictions, but may also occur in reference labels (ground truth, gold standard diagnosis) for training and validation data. Classifier performance is usually ex…

2013-01-02abs ↗pdf ↗

Study compares federated learning and coreset approaches for privacy in distributed machine learning.

problem Measuring privacy in distributed machine learning approaches.
method Comparison of federated learning and coreset approaches using membership inference attack.
result Federated learning offers better privacy than coreset, but with higher communication cost.

Directional and pairwise measurements are often used to model inter-relationships in a social network setting. The Mixed-Membership Stochastic Blockmodel (MMSB) was a seminal work in this area, and many of its capabilities were extended since then. In this paper, we propose the \emph{Dynamic Infinite Mixed-Membership s…

2013-06-13abs ↗pdf ↗

A new method clusters data from multiple sources using a mixture of multilayer SBMs.

problem Aggregating multiple clustering results from different data sources.
method Uses a mixture of multilayer Stochastic Block Models (SBM) to group co-membership matrices.
result Identifies and clusters observations based on their specificities within components.

A new model estimates mixed memberships for categorical data with weighted responses.

problem Limited applicability of existing GoM model to weighted categorical data.
method Proposes Weighted Grade of Membership (WGoM) model, relaxing distribution constraints.
result WGoM can describe any response matrix with finite distinct elements.

We consider the problem of estimating community memberships of nodes in a network, where every node is associated with a vector determining its degree of membership in each community. Existing provably consistent algorithms often require strong assumptions about the population, are computationally expensive, and only p…

2017-09-01abs ↗pdf ↗