A new protocol for private averaging protects data privacy in a crowd of users.
problem Protecting privacy in a crowd of users sharing personal data.
method Massively distributed algorithm for private averaging with malicious adversaries.
result Privacy is preserved even with malicious users, and the algorithm can find arbitrary accuracy solutions.
Improved private sample complexity for answering classification queries.
problem Designing an algorithm to accurately answer classification queries while maintaining differential privacy.
method Formally studied in agnostic PAC model, derived new upper bound on private sample complexity.
result Improved private sample complexity bound for answering classification queries.
Private credit markets have expanded significantly, offering unique lending technology to private equity firms.
problem Understanding the growth and characteristics of private credit markets.
method Systematic survey of academic literature, development of integrated theoretical framework, empirical evidence.
result Private credit markets offer a distinct lending technology with higher spreads over syndicated loans.
This paper adapts PATE for semantic segmentation while maintaining privacy.
problem Preserving privacy in medical machine learning, especially for sensitive information.
method Adapting PATE for semantic segmentation using low-dimensional representations and low-sensitivity queries.
result An Autoencoder-based PATE variant achieves a higher Dice coefficient for the same privacy guarantee.
The private car license plates issued in Shanghai are bestowed the title of "the most expensive sheet iron all over the world", more expensive than gold. A citizen has to bid in an monthly auction to obtain a license plate for his new private car. We perform statistical analysis to investigate the influence of the mini…
A framework for private causal effect estimation without structural assumptions.
problem Estimating causal effects from private observational data.
method Model-agnostic framework that privatizes predictions and aggregation steps.
result Maintains competitive performance under realistic privacy budgets.
New method reduces communication in distributed learning, improving privacy and utility.
problem Distributed learning with minimal communication and privacy protection.
method Non-interactive blind model averaging (BlindAvg) with output perturbation.
result BlindAvg converges to centralized learning with strong L2-regularization and SoftmaxReg for better privacy-utility tradeoff.
Gradient noise improves privacy-protected optimization performance.
problem Improving privacy in convex optimization while maintaining utility.
method We analyze the effect of gradient perturbation on differentially private convex optimization, focusing on expected curvature.
result Gradient perturbation can achieve a significantly improved utility guarantee for differentially private convex optimization.
AdaDPS uses side information to improve private adaptive optimization.
problem Private adaptive optimization methods degrade when training with differential privacy.
method AdaDPS uses non-sensitive side information to precondition gradients.
result AdaDPS reduces the amount of noise needed for similar privacy guarantees, improving optimization performance.
Solves a game between brokers and informed traders using stochastic differential equations.
problem Optimizing wealth in a game between brokers and informed traders with private signals.
method Closed-form solutions to a mean-field game using forward-backward SDEs.
result Optimal trading strategies for both brokers and informed traders are found.
Study on InstaHide's security, linking to phase retrieval problem.
problem Security of InstaHide scheme for private dataset sharing.
method Design of a provable algorithm for private vector recovery.
result Private vectors can be recovered using synthetic vectors and public vectors.
Locally private online quantile regression method addresses privacy constraints.
problem Estimating and inferring quantile regression under local differential privacy constraints.
method Developed a finite-alphabet channel where users compute local contributions, apply randomized response, and send reports. A public decoder corrects distortion and reconstructs inputs for averaging.
result Established local privacy, decoder unbiasedness, consistency, asymptotic normality, and inference for scalar contrasts.
DP-SGD provides privacy guarantees for all data points, but we propose output-specific DP to better account for individual examples.
problem Accounting for individual privacy guarantees in DP-SGD.
method Output-specific (ε,δ)-DP and an efficient algorithm to investigate individual privacy across datasets. result Most examples enjoy stronger privacy guarantees than the worst-case bound, and there is a correlation between training loss and privacy parameter.
Estimates multi-attribute choice preferences using private signals and matrix factorization.
problem Modeling multi-attribute choice preferences under weak assumptions.
method Generative choice model with latent factor matrices and private signals; multi-stage matrix factorization.
result Validated estimation performance of novel algorithm through simulations.
Unified analysis of Federated Averaging and Nesterov FedAvg for linear speedup.
problem Understanding convergence of FL algorithms under non-i.i.d. data and partial participation.
method Systematic study of convergence guarantees for FedAvg and Nesterov FedAvg under different conditions.
result Unified analysis of linear speedup for FedAvg and Nesterov FedAvg in various settings.
DP-SEP privatizes EP by refining a single factor per data point.
problem Private inference of complex models with limited memory.
method Stochastic Expectation Propagation with differential privacy.
result DP-SEP provides better posterior estimates with guaranteed privacy.
A new method for private query release using Johnson-Lindenstrauss projection.
problem Private release of query answers with minimal privacy loss.
method Random projection of query answers to a lower dimension, followed by noise addition.
result Optimal worst-case sample complexity for answering a workload of k queries.
FedMD combines model distillation for federated learning with private models.
problem Federated learning's limitation in handling private, independently designed models.
method Transfer learning and knowledge distillation.
result Models achieve 20% average accuracy gain through collaboration.
New DP algorithm improves privacy and efficiency for convex optimization.
problem Efficient, DP algorithms for convex optimization with strong excess risk bounds.
method Output perturbation for a broad class of tilted loss functions.
result Near optimal DP excess risk and runtime bounds for convex optimization.
New algorithm for federated learning with non-smooth regularizers.
problem Federated Learning with non-smooth composite optimization problems.
method Proposed Federated Dual Averaging (FedDualAvg) algorithm to overcome convergence issues.
result FedDualAvg outperforms other algorithms in federated composite optimization.
Paper proves convergence for private FL on non-Lipschitz convex objectives using normalization instead of clipping.
problem Lack of convergence results for differentially private federated learning with non-Lipschitz objectives.
method Developed a convergence result for private FL on smooth convex objectives without assuming Lipschitzness, using normalization instead of clipping.
result Normalization-based private FL algorithm converges better than clipping-based counterpart on smooth convex functions.
Distributed estimation and learning with privacy preserved.
problem Privacy-preserving distributed estimation and learning in a networked environment.
method Linear aggregation schemes with differential privacy constraints.
result Noise minimizes convergence time to best estimates, using Laplace noise.
We compare three network portfolio selection methods; hierarchical clustering trees, minimum spanning trees and neighbor-Nets, with random and industry group selection methods on twelve years of data from the 30 Dow Jones Industrial Average stocks from 2001 to 2013 for very small private investor sized portfolios. We f…
Improved DP-SGD for variational inference reduces noise and variance.
problem Poor convergence and high variance in variational parameter outputs due to gradient noise in DP-SGD.
method Introduced aligned gradients and iterate averaging to reduce DP-induced noise, and noise-aware posteriors.
result Less noisy gradient estimator and improved parameter estimates for variational inference.
A new method for privacy-preserving Bayesian learning in federated learning.
problem Privacy-preserving learning of models from distributed sensitive data.
method Differentially private partitioned variational inference (DPVI) for federated learning.
result First general framework for federated Bayesian learning with differential privacy.
FedHDPrivacy uses DP to improve FL in IoT, maintaining high accuracy.
problem Privacy threats in FL, especially in IoT environments.
method Integrates DP with neuro-symbolic computing, actively monitoring and adjusting noise.
result Maintains high performance in manufacturing monitoring, surpassing other FL methods.
Develops privacy-preserving methods for equivalence testing in healthcare.
problem Protecting patient data in healthcare studies.
method Differential privacy techniques for simulation-based calibration.
result Maintains type-I error control and comparable power to non-private methods.
FURL improves model accuracy in FL by locally training user embeddings.
problem Improving prediction accuracy of neural-network-based models in Federated Learning.
method FURL divides model parameters into federated and private parameters, training private parameters locally.
result Significant performance improvement with 8% and 51% increases on two datasets.
A new algorithm speeds up multi-agent reinforcement learning.
problem Complex interactions between agents in multi-agent reinforcement learning.
method Double averaging scheme for decentralized convex-concave saddle-point problems.
result The algorithm converges to the optimal solution at a global geometric rate.
Study evaluates early-stage cybersecurity firms' performance using Crunchbase data.
problem Assessing performance of early-stage cybersecurity startups.
method Empirical analysis of 19 cybersecurity sectors using Crunchbase data.
result Significant variations in capital raised and post-money valuations across cybersecurity sectors.
Improved federated learning methods for privacy and efficiency.
problem Privacy and efficiency trade-offs in federated learning.
method FedHybrid and FedNewton: improved federated learning algorithms.
result Achieved comparable accuracy to FedSGD with fewer communication rounds.
This paper studies trade-offs in private prediction methods.
problem Leakage of training data information in machine learning predictions.
method Private training and private prediction methods with trade-offs.
result Private training methods outperform private prediction methods in various settings.
Private method measures nonlinear correlations between data hosted across two entities.
problem Measuring nonlinear correlations between sensitive data hosted across multiple parties while preserving privacy.
method Differentially private estimator of distance correlation.
result First private estimator of nonlinear correlations in a multi-party setup.
LEASGD improves privacy-preserving decentralized learning with lower communication costs.
problem Achieving efficient and private decentralized learning.
method Proposes LEASGD, a Leader-Follower Elastic Averaging Stochastic Gradient Descent algorithm.
result LEASGD outperforms state-of-the-art algorithms in terms of lower loss and reduced communication costs.
A new private algorithm for bandit problems meets lower bounds.
problem Optimal private solution for stochastic multi-arm bandit.
method Private Successive Elimination based on optimal private stopping rule.
result Optimal private algorithm meets both non-private and private lower bounds.
New optimization for federated learning with local models.
problem Training models with private data from multiple devices.
method Proposes a new optimization formulation and efficient SGD variants.
result Local steps can improve communication for heterogeneous data.
New algorithms for privately learning decision lists and halfspaces.
problem Private learning of decision lists and halfspaces.
method Differentially private algorithms for PAC and online models.
result Private algorithms match or surpass non-private guarantees.
Private PGB boosts synthetic data quality using GANs and privacy techniques.
problem Differentially private GANs struggle with convergence and poor output quality.
method Combines reweighted samples from GAN training using Private Multiplicative Weights method.
result Improves synthetic data quality across various datasets and tasks.
Near-optimal private tests for simple and MLR hypotheses developed under Gaussian differential privacy.
problem Developing private tests for simple and MLR hypotheses under Gaussian differential privacy.
method A private mean estimator with data-driven clamping bounds, constructing private test statistics.
result Private tests achieve the same asymptotic relative efficiency as non-private most powerful tests.
PEARL uses AI to replicate private equity performance with liquid assets.
problem Lack of access to private equity due to high costs and complexity.
method Combines AI with liquid assets, incorporating asymmetry for better performance.
result Model outperforms liquid proxies and aligns with private equity benchmarks.
A federated learning framework using superquantile aggregation for robust performance across heterogeneous data.
problem Robust predictive performance across clients with heterogeneous data.
method Superquantile-based learning objective and stochastic training algorithm with differential privacy.
result Proves finite time convergence guarantees and demonstrates competitive performance with tail statistics improvement.
Public pretraining improves private model training even in extreme distribution shift scenarios.
problem Improving private model training accuracy in settings with large distribution shift.
method Empirical evaluation and theoretical explanation of public representations improving private training accuracy.
result Public representations can improve private training accuracy by up to 67% over private training from scratch in settings with large distribution shift.
FedGP uses GANs to generate private data samples in federated learning.
problem Privacy-preserving data release in federated learning.
method FedGP employs generative adversarial networks (GANs) with FedAvg for privacy-preserving data generation.
result FedGP generates high-quality labelled data that can train and validate supervised models securely.
Private learning of Gaussian Mixture Models without boundedness assumptions.
problem Private estimation of parameters of Gaussian Mixture Models with unbounded components.
method Reduction to non-private problem, blackbox privatization, Moitra and Valiant's algorithm.
result First sample complexity upper bound and polynomial time algorithm for privately learning GMMs.
Private estimation with public data reduces sample complexity.
problem Estimating private distributions with limited public data.
method Differentially private estimation with public data under constraints of pure or concentrated DP.
result Public data can significantly reduce private sample complexity for estimation.
Local GD proves effective for heterogeneous data in federated learning.
problem Minimizing functions from private, heterogeneous data in federated learning.
method Local gradient descent for smooth, convex functions.
result Communication complexity similar to gradient descent in low accuracy regime.
New method generates private synthetic data without domain size dependence.
problem Private synthetic data generation for unbounded query classes.
method Constructs a private synthetic data generator for privately PAC learnable query classes.
result Sample complexity independent of domain size for privately PAC learnable query classes.
The paper explores learning with a mix of private and public data while maintaining privacy.
problem Learning with a mix of private and public data while ensuring differential privacy.
method Designing a learning algorithm that satisfies differential privacy only with respect to private examples.
result A hypothesis class of VC-dimension d can be agnostically learned up to an excess error of α using only (roughly) d/α public examples and d/α^2 private labeled examples.