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

3517021,0531,404 · Jun 202019922001200920172026
48 results for Tiny Models

Finding Tiny Faces (by Hu and Ramanan) proposes a novel approach to find small objects in an image. Our contribution consists in deeply understanding the choices of the paper together with applying and extending a similar method to a real world subject which is the counting of people in a public demonstration.

2018-01-19abs ↗pdf ↗

ThriftyNet uses a single convolutional layer recursively to maximize parameter usage.

problem Maximizing the use of parameters in deep convolutional neural networks.
method A single convolutional layer is used recursively, with normalization, non-linearities, downsampling, and shortcuts to maintain model expressivity.
result ThriftyNet achieves competitive performance with significantly fewer parameters.

New algorithm PRACTISE accelerates networks with tiny sets, reducing latency by 22%.

problem Accelerating networks with tiny training sets to improve performance and privacy.
method Proposes a new algorithm PRACTISE based on finetune convexity hypothesis and feature mimicking.
result PRACTISE outperforms previous methods by reducing latency by 22% on ImageNet-1k.

Improved deep learning model deployment on tiny MCUs with mixed-precision quantization.

problem Memory limitations prevent accurate deployment of DNN models on tiny MCUs.
method Automated mixed-precision quantization using Reinforcement Learning for MCU constraints.
result Mixed-precision models achieve high accuracy with uniform quantization policies.

This work analyzes how frequency components affect CNN predictions and robustness.

problem Lack of frequency-based explanation for CNNs leading to vulnerabilities.
method Frequency component analysis and quantification of their contribution to CNN predictions.
result Adversarial attacks exploit high-frequency features, while robustness comes from low-frequency associations.

Study Lie algebras with complex structures, focusing on degenerations and deformations.

problem Understanding the space of Lie algebras with complex structures and their transformations.
method Identifying invariants that remain consistent under degenerations and applying to four-dimensional case.
result Found invariants that help in understanding the behavior of Lie algebras under complex structures.

POET enables large neural network training on tiny devices with reduced energy.

problem Training large neural networks on memory-limited edge devices.
method Jointly optimizes rematerialization and paging for memory reduction, formulating an MILP for energy-efficient training.
result POET trains ResNet-18 and BERT within Cortex-M memory constraints, outperforming current methods in energy efficiency.

AL0\ell_0CORE tensor decomposition reduces computational cost for sparse count data.

problem Efficiently decompose sparse count data matrices.
method Probabilistic Tucker decomposition with 0\ell_0-norm constraint.
result AL0\ell_0CORE achieves similar results to full Tucker decomposition at a fraction of the cost.

Improved robustness of machine learning models with controlled Lipschitz constants.

problem Vulnerability of state-of-the-art models to adversarial attacks.
method Proposes a CLL loss that calibrates the margin and Lipschitz constant penalties, improving robustness certificates.
result Consistently outperforms other losses on CIFAR-10, CIFAR-100, and Tiny-ImageNet datasets.

Review of efficient neural networks for TinyML on resource-constrained devices.

problem Resource constraints on ultra-low power MCUs for deep learning models.
method Model compression, quantization, low-rank factorization, model pruning, hardware acceleration, algorithm-architecture co-design.
result Optimized neural network architectures for minimal resource utilization on MCUs.

We show that in a variety of large-scale deep learning scenarios the gradient dynamically converges to a very small subspace after a short period of training. The subspace is spanned by a few top eigenvectors of the Hessian (equal to the number of classes in the dataset), and is mostly preserved over long periods of tr…

2018-12-12abs ↗pdf ↗

A new mutual information optimization method using self-supervised binary contrastive learning.

problem Improving self-supervised contrastive learning for better model performance.
method Proposes a novel loss function for contrastive learning that optimizes mutual information in positive and negative pairs.
result The proposed method outperforms state-of-the-art self-supervised contrastive frameworks on various benchmark datasets.

Recent research showed that deep neural networks are highly sensitive to so-called adversarial perturbations, which are tiny perturbations of the input data purposely designed to fool a machine learning classifier. Most classification models, including deep learning models, are highly vulnerable to adversarial attacks.…

2018-01-12abs ↗pdf ↗

In continual learning (CL), an agent learns from a stream of tasks leveraging prior experience to transfer knowledge to future tasks. It is an ideal framework to decrease the amount of supervision in the existing learning algorithms. But for a successful knowledge transfer, the learner needs to remember how to perform …

2019-02-27abs ↗pdf ↗

New framework explains adversarial examples in neural nets.

problem Adversarial examples in deep neural networks are counterintuitive and hard to explain.
method Introduces Dimpled Manifold Model to explain training phases and adversarial examples.
result Shows how adversarial examples arise from training dynamics and dimpling phase.

This paper represents a preliminary (pre-reviewing) version of a sublinear variational algorithm for isotropic Gaussian mixture models (GMMs). Further developments of the algorithm for GMMs with diagonal covariance matrices (instead of isotropic clusters) and their corresponding benchmarking results have been published…

2018-10-01abs ↗pdf ↗

GraphXCOVID uses deep semi-supervised learning to identify COVID-19 from chest X-rays with minimal labels.

problem Identifying COVID-19 on chest X-rays with limited labelled data.
method Graph-based deep semi-supervised framework with pseudo-labeling and attention maps.
result Outperforms current supervised models with a tiny fraction of labelled examples.

RobNets improve robustness of deep neural networks against adversarial attacks.

problem Vulnerability of deep neural networks to adversarial attacks.
method One-shot neural architecture search, finetuning sub-networks, and analyzing robustness indicators.
result RobNets achieve superior robustness performance across various datasets.

Proposes a method to improve neural architectures reproducibly.

problem Lack of reproducibility in Neural Architecture Transformer (NAT).
method Differentiable Neural Architecture Transformation (DNAT).
result DNAT outperforms NAT and is applicable to various models and datasets.

Sharp results link DLN gradient flow to basis pursuit optimization and GHA phase transitions.

problem Understanding implicit regularization in Diagonal Linear Networks.
method Sharp convergence bounds and characterization of 1\ell_1 minimizers.
result Gradient flow of DLNs with tiny initialization approximates minimizers of basis pursuit optimization problem.

Large size models are implemented in recently ASR system to deal with complex speech recognition problems. The num- ber of parameters in these models makes them hard to deploy, especially on some resource-short devices such as car tablet. Besides this, at most of time, ASR system is used to deal with real-time problem …

2018-07-02abs ↗pdf ↗

Dropout is often used in deep neural networks to prevent over-fitting. Conventionally, dropout training invokes \textit{random drop} of nodes from the hidden layers of a Neural Network. It is our hypothesis that a guided selection of nodes for intelligent dropout can lead to better generalization as compared to the tra…

2018-12-10abs ↗pdf ↗

VoiceFilter-Lite separates speech from background in real-time for on-device speech recognition.

problem Separate speech from background in real-time for on-device speech recognition.
method Asymmetric loss, adaptive runtime suppression, quantization to 8-bit.
result VoiceFilter-Lite achieves real-time speech separation and maintains speech recognition performance.

In this short article we investigate the topology of the moduli space of two-convex embedded tori Sn1×S1Rn+1S^{n-1}\times S^1\subset \mathbb{R}^{n+1}. We prove that for n3n \geq 3 this moduli space is path-connected, and that for n=2n = 2 the connected components of the moduli space are in bijective correspondence with the knot…

2017-03-06abs ↗pdf ↗

Linear models can be poisoned by shifting a fraction of one class's data, revealing scaling laws and weight alignment.

problem Understanding and quantifying data poisoning in linear models.
method Analysis of ridge least squares with an unpenalized intercept, using resolvent techniques and random matrix theory.
result Closed-form limits for the poisoned score, revealing scaling laws and weight alignment with the poisoning direction.