Search Results for author:
Found 7 papers, 3 papers with code
BINAS: Bilinear Interpretable Neural Architecture Search
Practical use of neural networks often involves requirements on latency, energy and memory among others.
HardCoRe-NAS: Hard Constrained diffeRentiable Neural Architecture Search
Realistic use of neural networks often requires adhering to multiple constraints on latency, energy and memory among others.
Ranked #21 on
Neural Architecture Search
on ImageNet
A Convergence Theory Towards Practical Over-parameterized Deep Neural Networks
We show that convergence to a global minimum is guaranteed for networks with widths quadratic in the sample size and linear in their depth at a time logarithmic in both.
Knapsack Pruning with Inner Distillation
Through this we produce compact architectures with the same FLOPs as EfficientNet-B0 and MobileNetV3 but with higher accuracy, by $1\%$ and $0. 3\%$ respectively on ImageNet, and faster runtime on GPU.
Ranked #3 on
Network Pruning
on ImageNet
Classical Scaling Revisited
We present an efficient solver for Classical Scaling (a specific MDS model) by extending the distances measured from a subset of the points to the rest, while exploiting the smoothness property of the distance functions.
On the optimality of shape and data representation in the spectral domain
This novel pseudo-metric allows constructing an LBO by which a scale invariant eigenspace on the surface is defined.
Graph matching: relax or not?
We consider the problem of exact and inexact matching of weighted undirected graphs, in which a bijective correspondence is sought to minimize a quadratic weight disagreement.
