Proposes a method for private aggregation in heterogeneous federated learning.
problem Ensuring resilience to Byzantine clients and maintaining client data privacy in federated learning with heterogeneous data.
method Careful co-design of verifiable secret sharing, secure aggregation, and private information retrieval scheme.
result Achieves information-theoretic privacy guarantees and Byzantine resilience under data heterogeneity.
Securely trains regression models with secret sharing for data collaboration.
problem Balancing data collaboration for technological improvements with security concerns.
method Secret sharing scheme for scalable and efficient secure multiparty training.
result Scalable and efficient protocols for training linear and logistic regression models.
SharedMF uses secret sharing to protect privacy in distributed recommendation systems.
problem Privacy issues in multi-source data for recommendation systems.
method Federated learning and secret sharing technology.
result SharedMF achieves faster execution speed and better data adaptability compared to homomorphic encryption methods.
Secure social recommendation framework using secret sharing.
problem Privacy concerns and reluctance to share social data in recommender systems.
method Secret Sharing based Matrix Multiplication (SSMM) protocol for secure data sharing and collaborative recommendation.
result SeSoRec framework improves recommendation performance and is secure.
FaceSigns embeds a secret watermark in images to authenticate and detect deepfakes.
problem Realistic image and video manipulation threats, especially deepfakes.
method Semi-fragile watermarking using neural networks, robust to face-swapping but fragile to deepfake manipulations.
result FaceSigns can reliably detect deepfake content with high accuracy.
A new federated learning method protects privacy in mobile crowdsensing.
problem Data and model privacy protection in federated extreme gradient boosting for mobile crowdsensing.
method Secret sharing based federated learning architecture FedXGB.
result FedXGB achieves less than 1% accuracy loss while preserving model privacy.
The vulnerability of machine learning systems to adversarial attacks questions their usage in many applications. In this paper, we propose a randomized diversification as a defense strategy. We introduce a multi-channel architecture in a gray-box scenario, which assumes that the architecture of the classifier and the t…
AriaNN enables private deep learning with minimal interaction and reduced key sizes.
problem Private deep learning with minimal interaction and reduced key sizes.
method Semi-honest 2-party computation protocol with function secret sharing, optimized primitives for neural network operations.
result Efficient private comparison for ReLU operations with reduced key size and improved performance.
Local regularization fails in transductive learning for some multiclass problems.
problem Whether local regularization can learn all transductive multiclass problems.
method Provided a negative answer by exhibiting a specific multiclass problem.
result Local regularization cannot learn all transductive multiclass problems.
This paper improves privacy accounting in decentralized FL using f-Differential Privacy.
problem Challenges in accurately quantifying privacy budget in decentralized FL.
method Develops two new f-DP-based accounting methods for decentralized FL.
result Yields tighter (ε,δ) bounds and improved utility compared to existing methods.
FastSecAgg improves federated learning security and efficiency.
problem Privacy leakage in federated learning due to model parameter sharing.
method Introduces FastSecAgg, a secure aggregation protocol with FFT-based multi-secret sharing (FastShare).
result Efficient in computation and communication, robust to client dropouts.
We develop a secure aggregation protocol for federated learning that reduces communication and computation costs.
problem Expensive communication and privacy concerns in federated learning.
method Adapting compression-based federated techniques to additive secret sharing.
result Our protocol achieves high accuracy with low communication costs and is more efficient than prior work.
Matryoshka hides secret models in a carrier model, achieving high capacity and robustness.
problem Stealing functionality of private ML data by hiding models in a carrier model.
method Parameter sharing approach exploiting the learning capacity of the carrier model.
result Hides a 26x larger secret model or 8 secret models in the carrier model.
A novel approach to federated learning with strong privacy guarantees.
problem Maintaining privacy of clients' data and federator's objective in federated learning.
method Inspired by knowledge distillation and private information retrieval, the approach combines secret-sharing-based multi-party computation and graph-based private information retrieval.
result Strong information-theoretic privacy guarantees for federated learning.
This work addresses privacy issues in IoT data sharing by balancing information disclosure and user privacy.
problem Balancing privacy and utility in time-series data sharing from IoT devices.
method Formulated as POMDPs, solved using A2C DRL, evaluated with synthetic and real data.
result Proposed policies achieve a good balance between privacy and utility.
Secret neural networks hidden within trained models.
problem Excess capacity in neural networks allows embedding secret models.
method Novel framework for hiding secret neural networks within carrier networks.
result Detection of hidden networks is computationally infeasible.
Turbo-Aggregate reduces secure aggregation time from quadratic to nearly linear.
problem Quadratic overhead in secure model aggregation for federated learning.
method Multi-group circular strategy, additive secret sharing, and coding techniques.
result Achieves O(NlogN) overhead, compared to O(N2), for up to 50% user dropout. CHEETAH speeds up secure MLaaS by 100x over fastest existing schemes.
problem Privacy-preserving machine learning on end devices.
method Ultra-fast secure MLaaS framework using secret sharing.
result More than 100x speedup over fastest existing schemes.
Researchers show how to secretly train models with hidden data, detect usage with high confidence.
problem Protecting training data from traceability in large language models.
method Gradient-based optimization to learn secret sequences absent from training data.
result Secret sequences can be learned by models without performance degradation, detectable with high confidence.
Efficient framework for training machine learning models at edge without data movement.
problem Lack of privacy-preserving and computationally efficient methods for deep learning model training.
method Privacy preserving FedCollabNN framework for federated learning.
result Framework is computationally efficient and robust against adversarial attacks.
Paper proposes protecting DNN models with secret key preprocessing.
problem Protecting deep learning models from unauthorized access.
method Block-wise pixel shuffling with secret key for preprocessing.
result Protected models maintain close performance to non-protected models with correct key, but accuracy drops significantly with incorrect key.
Supervised machine learning (ML) algorithms are aimed at maximizing classification performance under available energy and storage constraints. They try to map the training data to the corresponding labels while ensuring generalizability to unseen data. However, they do not integrate meaning-based relationships among la…
InstaHide encrypts images for privacy in distributed learning.
problem Private training of deep neural networks on distributed data.
method Encryption of training images with one-time secret keys and pixel-wise masks.
result Preserves privacy with minor accuracy loss, secure against known attacks.
New insights link diverse statistical problems via secret leakage planted clique.
problem Statistical-computational gaps in inference problems.
method Secret leakage planted clique as a new hardness assumption for reductions.
result Establishes tight statistical-computational tradeoffs for various problems.
Deep-Lock secures DNN models with secret keys.
problem Preventing unauthorized usage of DNN models.
method Uses S-Boxes and key scheduling to encrypt DNN parameters.
result Ensures correct functioning only with the correct secret key.
Adversarial training was recently shown to be competitive against supervised learning methods on computer vision tasks, however, studies have mainly been confined to generative tasks such as image synthesis. In this paper, we apply adversarial training techniques to the discriminative task of learning a steganographic …
Novel strategy for federated learning with privacy-preserving predictors and nonvacuous generalization bounds.
problem Privacy-preserving federated learning with nonvacuous generalization bounds.
method Randomized predictors, PAC-Bayesian generalization bound, synchronous and heterogeneous/homogenous cases.
result Achieves comparable predictive performance to batch approach while preserving privacy.
We build a multiassets heterogeneous agents model with fundamentalists and chartists, who make investment decisions by maximizing the constant relative risk aversion utility function. We verify that the model can reproduce the main stylized facts in real markets, such as fat-tailed return distribution and long-term mem…
Paper evaluates and mitigates privacy risks in deep learning models.
problem Quantifying and defending against privacy attacks in deep learning.
method Quantitative evaluation of trade-offs, reformulating attacks, and proposing a novel SPN.
result Model accuracy improved by 5-20% while maintaining data privacy.
A mechanism to share risks and costs with guarantees against extreme outcomes.
problem Softening extreme individual burdens in risk sharing schemes.
method Formalizes Certified Allocation Problem; uses Conformal Risk Sharing with interpretable sharing policy and split conformal calibration.
result Reduces extreme obligations for high-risk agents while controlling harm to others.
Poisoning datasets can reveal private details of other users' training points.
problem Integrity and privacy of machine learning training data.
method Active inference attacks that poison a small fraction of the training dataset.
result Poisoning as little as 0.1% of the training dataset can significantly boost inference attacks.
Paper improves privacy for language models against reconstruction attacks.
problem Reconstruction attacks can regenerate training data from language models.
method Uses Rényi differential privacy with optimized privacy budgets.
result Better privacy guarantees for extraction of rare secrets.
The paper verifies no cosmetic surgeries on knots and 3-manifolds using hyperbolic geometry.
problem Checking cosmetic surgeries on knots and 3-manifolds.
method Knot invariants and hyperbolic geometry.
result Verification of no cosmetic surgeries on knots and 3-manifolds.
Paper introduces proof-of-learning to verify ML model training.
problem No mechanism to prove ML model training parameters were obtained through optimization.
method Inspired by proof-of-work and verified computations, introduces proof-of-learning mechanism.
result Proves model training parameters were obtained through optimization with minimal adversary work.
Multitask learning (MTL) aims to learn multiple tasks simultaneously through the interdependence between different tasks. The way to measure the relatedness between tasks is always a popular issue. There are mainly two ways to measure relatedness between tasks: common parameters sharing and common features sharing acro…
BONAS accelerates NAS while maintaining reliability.
problem Computational inefficiency in sample-based NAS.
method Bayesian Optimized Neural Architecture Search (BONAS) using weight-sharing.
result BONAS accelerates sample-based NAS significantly while maintaining reliability.
DeepSeekMoE improves language model efficiency with shared experts and normalized gating.
problem Improving sample efficiency in language model architectures.
method Theoretical and empirical analysis of shared experts and normalized sigmoid gating.
result Theoretical and empirical evidence of improved sample efficiency with shared experts and normalized gating.
Decor protects decentralized learning models from curious users.
problem Privacy violation in decentralized learning.
method Decor uses correlated Gaussian noises to protect local models in decentralized SGD with differential privacy guarantees.
result Decor matches central DP optimal privacy-utility trade-off for arbitrary connected graphs.
Survey solves curvature problems with hyperbolic spaces.
problem Singularities in hypersurface geometry.
method Hyperbolic unfolding correspondence linking hypersurfaces to Gromov hyperbolic spaces.
result Eliminates hypersurface singularities in scalar curvature geometry.
The paper connects GL-racks to knot coloring invariants.
problem Understanding invariants of Legendrian knots.
method Exploring GL-racks and their decomposition into permutation and block GL-racks.
result Equivalent coloring invariants for knots with identical classical invariants.
LLT-ECG classifies ECG signals without backpropagation using linear laws.
problem ECG signal classification efficiency and verifiability.
method Forward linear law identification for ECG signal features.
result State-of-the-art performance on real-world ECG datasets.
Machine Learning (ML) algorithms are used to train computers to perform a variety of complex tasks and improve with experience. Computers learn how to recognize patterns, make unintended decisions, or react to a dynamic environment. Certain trained machines may be more effective than others because they are based on mo…
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.
BASIS improves LLM reasoning by sharing batchwise rollout info, reducing MSE by 69%.
problem Improving large language model reasoning with limited rollouts and batch information.
method BASIS samples only one rollout per prompt but uses batch information to improve value function estimation.
result BASIS reduces MSE in value function estimation by 69% compared to REINFORCE++.
Privacy improves robustness in statistical estimation.
problem Sparse mean estimation under privacy constraints.
method Sum-of-Squares method and exponential-time mechanisms.
result Private algorithms matching optimal tradeoffs are not known, but achieved via Sum-of-Squares.
Data taggants verify dataset ownership without harming models or requiring model internals.
problem Verifying dataset ownership without harming models or requiring model internals.
method Using pairs of out-of-distribution samples and random labels as secret keys, subtly altering a dataset to detect models trained on it.
result Data taggants reliably detect models trained on the protected dataset with high confidence, without compromising validation accuracy.
This paper improves auto-augment efficiency by sharing augmentation weights.
problem Efficient evaluation of augmentation policies for model training.
method Augmentation-Wise Weight Sharing (AWS) to create a fast yet accurate proxy task.
result Augmentation policies found achieve superior accuracies compared to existing methods.
We consider the problem of aggregating models learned from sequestered, possibly heterogeneous datasets. Exploiting tools from Bayesian nonparametrics, we develop a general meta-modeling framework that learns shared global latent structures by identifying correspondences among local model parameterizations. Our propose…