Compact DNNs increase memory footprint and reduce energy efficiency.
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.
Trend · papers per month
Automates graph convolutional network design for semi-supervised node classification.
Bézier-GAN optimizes airfoil design by reducing shape complexity.
Compact semiconductor device models are essential for efficiently designing and analyzing large circuits. However, traditional compact model development requires a large amount of manual effort and can span many years. Moreover, inclusion of new physics (eg, radiation effects) into an existing compact model is not triv…
A new method achieves optimal uniformity in designs with minimal flexibility.
Proposes methods for local clustering in attributed graphs.
DeepPeep attacks DNN architectures to reveal design details, posing IP theft risks.
ConfHit provides valid guarantees for generative models without oracle access.
Despite the superior performance of deep learning in many applications, challenges remain in the area of regression on function spaces. In particular, neural networks are unable to encode function inputs compactly as each node encodes just a real value. We propose a novel idea to address this shortcoming: to encode an …
MO-PaDGAN improves multi-objective optimization by generating diverse and high-performing designs.
Deep neural networks have achieved impressive performance in many applications but their large number of parameters lead to significant computational and storage overheads. Several recent works attempt to mitigate these overheads by designing compact networks using pruning of connections. However, we observe that most …
SDRF estimates complex survey designs for conditional distributions.
DIGIT is a low-cost tactile sensor for in-hand manipulation.
Innovative ball bearing converts rotary to reciprocating motion.
This paper provides a generic framework of component analysis (CA) methods introducing a new expression for scatter matrices and Gram matrices, called Generalized Pairwise Expression (GPE). This expression is quite compact but highly powerful: The framework includes not only (1) the standard CA methods but also (2) sev…
Liouville domains have become central objects in symplectic and contact geometry. However, the auxiliary data they involve --- namely, Liouville forms --- and the non-compactness of their completions generate some inconvenience. The notion of ideal Liouville domains is designed to suppress these awkward aspects and to …
We present a construction, called the limit of a tree system of spaces (or, less formally, a tree of spaces). The construction is designed to produce compact metric spaces that resemble fractals, out of more regular spaces, such as closed manifolds, compact polyhedra, compact Menger manifolds, etc. Such spaces are pote…
Algorithm identifies Pareto optimal designs efficiently for noisy, multi-objective functions.
This paper proposes BRIEF, a backward reduction algorithm that explores compact CNN-model designs from the information flow perspective. This algorithm can remove substantial non-zero weighting parameters (redundant neural channels) of a network by considering its dynamic behavior, which traditional model-compaction te…
Audio fingerprinting, also named as audio hashing, has been well-known as a powerful technique to perform audio identification and synchronization. It basically involves two major steps: fingerprint (voice pattern) design and matching search. While the first step concerns the derivation of a robust and compact audio si…
This paper continues the study of a class of compact convex hypersurfaces in Euclidean space , which are boundaries of compact convex bodies obtained by taking the intersection of (solid) confocal paraboloids of revolution. Such hypersurfaces are called reflectors. In reflectors arise naturall…
Compact models for methane/air combustion reduce complexity without sacrificing accuracy.
Efficient algorithm converges to Nash equilibrium in bilinear problems with bandit feedback.
The paper extends consistency results for sequential design strategies to vector-valued Gaussian processes.
Paper uses relaxation techniques to find optimal brokerage fees with private signals.
Compact models for NOX formation during methane combustion are created using a new algorithm.
One of the greatest challenges in the design of a real-time perception system for autonomous driving vehicles and drones is the conflicting requirement of safety (high prediction accuracy) and efficiency. Traditional approaches use a single frame rate for the entire system. Motivated by the observation that the lack of…
This paper proposes a new evaluation metric and boosting method for weight separability in neural network design. In contrast to general visual recognition methods designed to encourage both intra-class compactness and inter-class separability of latent features, we focus on estimating linear independence of column vec…
Deep convolutional neural networks are known to specialize in distilling compact and robust prior from a large amount of data. We are interested in applying deep networks in the absence of training dataset. In this paper, we introduce deep audio prior (DAP) which leverages the structure of a network and the temporal in…
Machine learning finds a compact fixed point action for SU(3) gauge theory.
We introduce and develop fine shape, which has a very simple definition and aims to supersede all previously known shape theories for metrizable spaces. The problem with known shape theories of metrizable spaces is illustrated by the following bizarre situation. Čech cohomology is an invariant of shape, and a fortiori …
We study a new class of codes for lossy compression with the squared-error distortion criterion, designed using the statistical framework of high-dimensional linear regression. Codewords are linear combinations of subsets of columns of a design matrix. Called a Sparse Superposition or Sparse Regression codebook, this s…
In many state-of-the-art compression systems, signal transformation is an integral part of the encoding and decoding process, where transforms provide compact representations for the signals of interest. This paper introduces a class of transforms called graph-based transforms (GBTs) for video compression, and proposes…
Torelli space (in genus g) is the moduli space of compact Riemann surfaces of genus g together with a symplectic basis of their first homology group. It is the quotient of the genus g Teichmuller space by the Torelli group T_g and is a model of the classifying space of T_g. It is known that almost all T_g are not finit…
Deep learning using neural networks has provided advances in image style transfer, merging the content of one image (e.g., a photo) with the style of another (e.g., a painting). Our research shows this concept can be extended to analyse the design of streetscapes in relation to health and wellbeing outcomes. An Austral…
We consider the problem of maximizing a non-concave Lipschitz multivariate function over a compact domain by sequentially querying its (possibly perturbed) values. We study a natural algorithm designed originally by Piyavskii and Shubert in 1972, for which we prove new bounds on the number of evaluations of the functio…
Optimal DP mechanisms for vector queries are found to be staircase distributions.
Dynamic Sparse Training finds efficient sparse networks from scratch.
Tensor neural network improves human pose classification from 3D skeleton data.
Introduces TT-NF for more compact neural field representations.
In this work, we propose a new recurrent autoencoder architecture, termed Feedback Recurrent AutoEncoder (FRAE), for online compression of sequential data with temporal dependency. The recurrent structure of FRAE is designed to efficiently extract the redundancy along the time dimension and allows a compact discrete re…
The paper introduces Causal Neural Operators to approximate operators in stochastic analysis.
In recent years, hyper-complex deep networks (such as complex-valued and quaternion-valued neural networks) have received a renewed interest in the literature. They find applications in multiple fields, ranging from image reconstruction to 3D audio processing. Similar to their real-valued counterparts, quaternion neura…
Binarization is an attractive strategy for implementing lightweight Deep Convolutional Neural Networks (CNNs). Despite the unquestionable savings offered, memory footprint above all, it may induce an excessive accuracy loss that prevents a widespread use. This work elaborates on this aspect introducing TentacleNet, a n…
Gradient boosted decision trees are a popular machine learning technique, in part because of their ability to give good accuracy with small models. We describe two extensions to the standard tree boosting algorithm designed to increase this advantage. The first improvement extends the boosting formalism from scalar-val…
EPICSCORE improves conformal scores by explicitly accounting for epistemic uncertainty.
Our goal is to design architectures that retain the groundbreaking performance of CNNs for landmark localization and at the same time are lightweight, compact and suitable for applications with limited computational resources. To this end, we make the following contributions: (a) we are the first to study the effect of…
Unsupervised segmentation learns features without labels, improving accuracy.