Search Results for author:
Found 19 papers, 7 papers with code
Mathematical Challenges in Deep Learning
Deep models are dominating the artificial intelligence (AI) industry since the ImageNet challenge in 2012.
Private GANs, Revisited
We show that the canonical approach for training differentially private GANs -- updating the discriminator with differentially private stochastic gradient descent (DPSGD) -- can yield significantly improved results after modifications to training.
Label Alignment Regularization for Distribution Shift
Recent work reported the label alignment property in a supervised learning setting: the vector of all labels in the dataset is mostly in the span of the top few singular vectors of the data matrix.
DP$^2$-VAE: Differentially Private Pre-trained Variational Autoencoders
Similar to other differentially private (DP) learners, the major challenge for DPGM is also how to achieve a subtle balance between utility and privacy.
Robust One Round Federated Learning with Predictive Space Bayesian Inference
In contrast, our method performs the aggregation on the predictive posteriors, which are typically easier to approximate owing to the low-dimensionality of the output space.
Mitigating Data Heterogeneity in Federated Learning with Data Augmentation
Federated Learning (FL) is a prominent framework that enables training a centralized model while securing user privacy by fusing local, decentralized models.
Federated Bayesian Neural Regression: A Scalable Global Federated Gaussian Process
We present Federated Bayesian Neural Regression (FedBNR), an algorithm that learns a scalable stand-alone global federated GP that respects clients' privacy.
Domain Adversarial Training: A Game Perspective
Defining optimal solutions in domain-adversarial training as a local Nash equilibrium, we show that gradient descent in domain-adversarial training can violate the asymptotic convergence guarantees of the optimizer, oftentimes hindering the transfer performance.
Proportional Fairness in Federated Learning
With the increasingly broad deployment of federated learning (FL) systems in the real world, it is critical but challenging to ensure fairness in FL, i. e. reasonably satisfactory performances for each of the numerous diverse clients.
$f$-Mutual Information Contrastive Learning
Self-supervised contrastive learning is an emerging field due to its power in providing good data representations.
f-Domain-Adversarial Learning: Theory and Algorithms
Unsupervised domain adaptation is used in many machine learning applications where, during training, a model has access to unlabeled data in the target domain, and a related labeled dataset.
Quantifying and Improving Transferability in Domain Generalization
We then prove that our transferability can be estimated with enough samples and give a new upper bound for the target error based on our transferability.
f-Domain-Adversarial Learning: Theory and Algorithms for Unsupervised Domain Adaptation with Neural Networks
We provide empirical results for several f-divergences and show that some, not considered previously in domain-adversarial learning, achieve state-of-the-art results in practice.
Newton-type Methods for Minimax Optimization
We prove their local convergence at strict local minimax points, which are surrogates of global solutions.
Federated Learning Meets Multi-objective Optimization
Federated learning has emerged as a promising, massively distributed way to train a joint deep model over large amounts of edge devices while keeping private user data strictly on device.
Optimality and Stability in Non-Convex Smooth Games
Convergence to a saddle point for convex-concave functions has been studied for decades, while recent years has seen a surge of interest in non-convex (zero-sum) smooth games, motivated by their recent wide applications.
Pressure-driven switching of magnetism in layered CrCl3
Layered transition-metal compounds with controllable magnetic behaviors provide many fascinating opportunities for the fabrication of high-performance magneto-electric and spintronic devices.
Materials Science
Convergence of Gradient Methods on Bilinear Zero-Sum Games
Min-max formulations have attracted great attention in the ML community due to the rise of deep generative models and adversarial methods, while understanding the dynamics of gradient algorithms for solving such formulations has remained a grand challenge.
Comparing EM with GD in Mixture Models of Two Components
In the case of mixtures of Bernoullis, we find that there exist one-cluster regions that are stable for GD and therefore trap GD, but those regions are unstable for EM, allowing EM to escape.
