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.
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 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.
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.
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.
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.
Develops Merton's model for private companies using DDM.
problem Lack of observable asset values for private companies.
method Uses dividend discount model (DDM) to develop structural model.
result Obtains closed-form formulas for equity and liability values, default probability.
Private learning can be used to efficiently solve online learning problems.
problem The relationship between differentially private learning and online learning efficiency.
method Derive an efficient black-box reduction from differentially private learning to online learning from expert advice.
result An efficient differentially private learner implies an efficient online learner.
Transform non-private e-values into differentially private ones.
problem Leaking sensitive data through non-private e-values.
method Developed a novel biased multiplicative noise mechanism.
result Differentially private e-values maintain strong statistical power and asymptotic equivalence to non-private ones.
Algorithm selects public datasets for private machine learning.
problem Choosing the most suitable public dataset for private machine learning.
method Measures gradient subspace distance between public and private datasets.
result Excess risk scales with the subspace distance between gradients.
Differentially private hyperparameter tuning improves privacy in machine learning.
problem Hyperparameter tuning leaks private information through selected configurations.
method Local Bayesian optimization using Gaussian Process surrogate for private gradient approximation.
result DP-GIBO converges to locally optimal hyperparameters with polynomial dimensional dependence.
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.
Optimizes private statistics with noisy methods.
problem Private inference in statistical models.
method Noisy optimization for M-estimators and confidence regions.
result Private estimators converge to non-private ones with high probability.
New private algorithms learn large-margin halfspaces efficiently.
problem Learning large-margin halfspaces with privacy constraints.
method Differentially private algorithms based on a new approach.
result Sample complexity depends only on the margin, not dimension.
Dynamic model considers private asset markets' complexities.
problem Understanding and optimizing private asset allocation.
method State-of-the-art dynamic model with machine learning.
result Optimal investment policies quantified over fund life.
Private algorithms minimize population loss with optimal rate.
problem Private optimization of convex functions with stochastic samples.
method Differentially private algorithms based on algorithmic stability.
result Optimal rate of 1 / n 1/\sqrt{n} 1/ n for population loss. Bounds on Littlestone dimension for private learning and online prediction.
problem Understanding the Littlestone dimension of composed classes for private learning.
method Deriving bounds on Littlestone dimension and transforming private learners.
result Improved bounds on sample complexity for private learning.
Private distribution learning with public data, leveraging sample compression schemes.
problem Private distribution learning with public and private samples under differential privacy constraints.
method Connection to sample compression schemes and list learning.
result At least d public samples are necessary for private learnability of Gaussians in R^d.
In recent years, the economic policy of privatization, which is defined as the transfer of property or responsibility from public sector to private sector, is one of the global phenomenon that increases use of markets to allocate resources. One important motivation for privatization is to help develop factor and produc…
Improved differentially private deep learning with group-wise clipping techniques.
problem Efficiency and privacy trade-offs in deep learning models.
method Group-wise clipping techniques (per-layer and per-device) to reduce compute time and memory overhead.
result Private learning with group-wise clipping achieves similar or better performance than non-private learning with less wall time.
New private learning algorithms improve utility in tasks with public features.
problem Private learning with public features in recommendation and ad prediction.
method Developed algorithms that protect only certain sufficient statistics, improving utility for linear regression and private recommendation benchmarks.
result Achieved state-of-the-art performance on private recommendation benchmarks.
Private learning can perform well in high dimensions, contrary to known results.
problem When does differentially private learning not suffer in high dimensions?
method Introduced a condition called restricted Lipschitz continuity to derive improved bounds for excess empirical and population risks.
result Gradients in private fine-tuning of large models are mostly controlled by a few principal components, similar to conditions for convex settings.
Private algorithms approximate matrices with private data.
problem Approximate matrices with same spectrum using private data.
method Differential privacy algorithms for unitary orbit optimization.
result Upper and lower bounds on approximation error.
New method for private density estimation of high-dimensional Gaussian mixtures.
problem Private density estimation for mixtures of unrestricted high-dimensional Gaussians.
method Exploits list global stability to prove upper bound on sample complexity.
result First upper bound on sample complexity for agnostic private density estimation.
Private algorithms adapt from public to private domains with minimal labeled data.
problem Adapting from a public source domain to a private target domain with few labeled data.
method Differentially private discrepancy minimization algorithms based on Frank-Wolfe and Mirror-Descent methods.
result Effective adaptation with strong generalization and privacy guarantees.
This paper develops a valuation model for private companies.
problem Lack of pricing and hedging models for private companies.
method Dynamic Gordon growth model, Maximum Likelihood (ML) estimators, Expectation Maximization (EM) algorithm.
result Closed-form pricing and hedging formulas for private companies.
Private learning needs more data or better features.
problem Improving differentially private machine learning performance.
method Demonstrates the need for either more private data or better features.
result Private learning requires either more data or better features.
Efficiently learns private models using public data.
problem Improving private learning performance with public data.
method Proves computationally efficient algorithms for private learning with public data.
result First computationally efficient algorithms for private learning with public data.
Study private query release with public data, reducing sample sizes.
problem Answering a wide range of statistical queries while maintaining privacy.
method Combines public and private samples to answer queries with differential privacy.
result Private and public sample complexities for different query classes.
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.
New algorithms improve privacy and utility of large language models.
problem Privacy-preserving fine-tuning of large language models.
method Meta-framework for differentially private fine-tuning, inspired by recent success in fine-tuning.
result Private fine-tuned models achieve utility close to non-private models, with improved privacy and efficiency.
Private statistical inference methods improve confidence interval lengths.
problem Constructing private confidence intervals with differential privacy.
method Proposed two private variants of non-parametric bootstrap.
result Achieve similar coverage accuracy to non-private methods with shorter intervals.
New findings show limitations in converting private learning to online learning efficiently.
problem Limitations in converting private learning to online learning efficiently.
method Assuming one-way functions, we show an efficient conversion from pure-private learners to online learners is impossible.
result Efficient conversion from pure-private learners to online learners is impossible under certain assumptions.
Paper develops differentially private methods for estimating precision matrices.
problem Estimating precision matrices from sensitive data while maintaining privacy.
method Differential privacy framework, ridge estimator, graphical lasso estimator, ADMM algorithm.
result The proposed methods provide utility in estimating precision matrices from private data.
Locally private Gaussian estimation tackles privacy in i.i.d. sample mean estimation.
problem Estimating the mean of an unknown Gaussian distribution while maintaining local differential privacy for each user.
method Adaptive two-round and nonadaptive one-round solutions for locally private Gaussian estimation.
result Upper bounds partially match with information-theoretic lower bounds, showing tightness up to logarithmic factors.
Differentially private algorithms for submodular maximization under various constraints.
problem Maximizing decomposable submodular functions under constraints while preserving privacy.
method Designing differentially private algorithms for both monotone and non-monotone decomposable submodular maximization under general matroid constraints.
result Improved utility guarantees and competitive performance compared to non-private algorithms.
New algorithm learns regression models privately under growth condition.
problem Private learning of nonparametric regression models.
method Novel filtering procedure to output stable hypotheses for nonparametric function classes.
result Established first nonparametric private learnability guarantee for diverging fat shattering dimensions.
New private algorithms for online learning improve regret in high privacy regimes.
problem Private online learning from experts and convex optimization.
method Transformed lazy algorithms for differential privacy.
result Improved regret bounds for DP-OPE and DP-OCO.
Private sketches protect linear regression data privacy.
problem Protecting sensitive information in linear regression.
method Release private sketches of datasets, compute approximate solutions.
result Private sketches maintain good approximation guarantees to the original problem.
Improved image generation with private data using perceptual features.
problem Difficulty in training generative models with differential privacy.
method Use pre-trained perceptual features to learn private data distribution.
result Generative models can generate high-quality images with low privacy budget ( ϵ ≈ 2 \epsilon \approx 2 ϵ ≈ 2 ). New methods for private statistical inference under local differential privacy.
problem Private statistical inference for population means with bounded observations.
method Nonparametric, nonasymptotic statistical inference using a generalized randomized response mechanism.
result Private confidence intervals and sequences for population means under LDP constraints.
DiPriMe forests use private medians to create balanced tree splits for privacy-protected data.
problem Privacy concerns in training random forests due to multiple data queries.
method Proposes DiPriMe forests, which use a private median to generate balanced splits, ensuring differential privacy.
result DiPriMe forests achieve high utility while maintaining differential privacy, as shown both theoretically and empirically.