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,742 papers · 148 categories

Trend · papers per month

0.3%0.5%0.8%0.2% · Aug 202119922001200920172026
27 results for EMNIST

Effective training of neural networks requires much data. In the low-data regime, parameters are underdetermined, and learnt networks generalise poorly. Data Augmentation alleviates this by using existing data more effectively. However standard data augmentation produces only limited plausible alternative data. Given t…

2017-11-12abs ↗pdf ↗

We study the problem of training machine learning models incrementally with batches of samples annotated with noisy oracles. We select each batch of samples that are important and also diverse via clustering and importance sampling. More importantly, we incorporate model uncertainty into the sampling probability to com…

2019-09-27abs ↗pdf ↗

Obtaining deep networks that are robust against adversarial examples and generalize well is an open problem. A recent hypothesis even states that both robust and accurate models are impossible, i.e., adversarial robustness and generalization are conflicting goals. In an effort to clarify the relationship between robust…

2018-12-03abs ↗pdf ↗

Predicts optimal training dataset sizes per class for machine learning models.

problem Optimizing training dataset sizes for class-specific machine learning models.
method Algorithm based on space-filling design of experiments, models like powerlaw curves and generalized linear models.
result The algorithm predicts optimal training dataset sizes per class for improved model performance.

Improved clustering accuracy with disentangled latent code representation.

problem Improving k-Means clustering performance.
method Optimizing the entanglement of autoencoder latent code representation using soft nearest neighbor loss with annealing temperature.
result 96.2% test clustering accuracy on MNIST, 85.6% on Fashion-MNIST, and 79.2% on EMNIST Balanced datasets.

The decentralized nature of federated learning makes detecting and defending against adversarial attacks a challenging task. This paper focuses on backdoor attacks in the federated learning setting, where the goal of the adversary is to reduce the performance of the model on targeted tasks while maintaining good perfor…

2019-11-18abs ↗pdf ↗

New method prevents posterior collapse in iVAE models.

problem Posterior collapse in iVAE models where observations and ICs are independent given covariates.
method Developed CI-iVAE by considering a mixture of encoder and posterior distributions in the objective function.
result Prevents posterior collapse, resulting in latent representations with more information of the observations.

A framework to compare federated learning algorithms in high-dimensional settings.

problem Comparing the performance of federated learning algorithms in high-dimensional settings.
method Formulating federated learning as a multi-criterion objective and analyzing a linear regression model.
result Federated Averaging with simple client fine-tuning achieves the same asymptotic risk as more intricate approaches and outperforms without personalization.

LotteryFL improves federated learning efficiency and personalization.

problem Statistical heterogeneity and communication efficiency in federated learning.
method Exploiting Lottery Ticket hypothesis to learn compact lottery networks.
result LotteryFL achieves better personalization and reduces communication cost.

Federated Learning with L0 constraint improves sparsity and performance.

problem Inherent sparsity in data and models leads to dense models with poor generalizability.
method L0 constraint on model density achieved through probabilistic gates and federated stochastic gradient descent.
result Achieves target sparsity (rho) in FL with minimal loss in statistical performance.

Optimal client sampling reduces communication in federated learning.

problem Efficiently aggregate model updates from distributed clients in federated learning.
method Model weights as an Ornstein-Uhlenbeck process to estimate uncommunicated updates; optimal client sampling strategy.
result Significant reduction in communication with competitive or superior performance.

Asynchronous distributed machine learning solutions have proven very effective so far, but always assuming perfectly functioning workers. In practice, some of the workers can however exhibit Byzantine behavior, caused by hardware failures, software bugs, corrupt data, or even malicious attacks. We introduce \emph{Karda…

2018-02-22abs ↗pdf ↗

Paper improves privacy-utility trade-off in federated learning.

problem Repeated parameter sharing in federated learning leaks private data.
method Proposes a new representation federated learning objective with differential privacy guarantees.
result Algorithm \DPFEDREP\ converges to a global optimal solution with a linear rate and privacy budget-dependent radius.

Boosting-inspired framework for federated learning with progressive model personalization.

problem Statistical heterogeneity across clients in federated learning.
method Construct an ensemble of personalized models, progressively increasing the depth of the personalized component while controlling its effective complexity.
result Consistently outperforms state-of-the-art PFL methods under heterogeneous data distributions.

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.

Two distinct limits for deep learning have been derived as the network width hh\rightarrow \infty, depending on how the weights of the last layer scale with hh. In the Neural Tangent Kernel (NTK) limit, the dynamics becomes linear in the weights and is described by a frozen kernel ΘΘ. By contrast, in the Mean-Field …

2019-06-19abs ↗pdf ↗