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

241483724965 · Jun 202019922001200920172026
48 results for Dilated Dense Networks

New models explain residual and dilated dense neural networks using sparse coding.

problem Lack of theoretical understanding of residual and dilated dense neural networks.
method Proposed Res-CSC and MSD-CSC models, derived mathematical relationships, implemented ISTA.
result Mathematical understanding of residual and dilated dense neural networks.

Image segmentation is widely used in a variety of computer vision tasks, such as object localization and recognition, boundary detection, and medical imaging. This thesis proposes deep learning architectures to improve automatic object localization and boundary delineation for salient object segmentation in natural ima…

2019-09-19abs ↗pdf ↗

RDL-Net improves speech enhancement with fewer parameters and better performance.

problem Improving speech enhancement with fewer parameters and better performance.
method Proposes RDL-Net, a CNN combining residual and dense aggregations without over-allocating parameters.
result RDL-Net achieves higher speech enhancement performance with fewer parameters and lower computational requirements.

Vanilla convolutional neural networks are known to provide superior performance not only in image recognition tasks but also in natural language processing and time series analysis. One of the strengths of convolutional layers is the ability to learn features about spatial relations in the input domain using various pa…

2019-05-08abs ↗pdf ↗

Study SL2(R)\mathrm{SL}_2(\mathbb{R}) dynamics on one-holed tori moduli space.

problem Understanding SL2(R)\mathrm{SL}_2(\mathbb{R}) action on one-holed tori moduli space.
method Proved every orbit is either closed or dense, and Teichmuller flow escapes to infinity.
result Every orbit of SL2(R)\mathrm{SL}_2(\mathbb{R}) action on one-holed tori moduli space is either closed or dense, and Teichmuller flow escapes to infinity.

If f is a conformal mapping defined on a connected open subset of a Carnot group G, then either f is the composition of a translation, a dilation and an isometry, or G is the nilpotent Iwasawa component of a real rank 1 simple Lie group S, and f arises from the action of S on G, viewed as an open subset of S/P, where P…

2013-12-22abs ↗pdf ↗

Different types of Convolutional Neural Networks (CNNs) have been applied to detect cancerous lung nodules from computed tomography (CT) scans. However, the size of a nodule is very diverse and can range anywhere between 3 and 30 millimeters. The high variation of nodule sizes makes classifying them a difficult and cha…

2019-01-01abs ↗pdf ↗

Maps between Riemannian manifolds which are submersions on a dense subset, are studied by means of the eigenvalues of the pull-back of the target metrics, the first fundamental form. Expressions for the derivatives of these eigenvalues yield characterizations of harmonicity, totally geodesic maps and biconformal change…

2008-09-09abs ↗pdf ↗

We consider the task of detecting regulatory elements in the human genome directly from raw DNA. Past work has focused on small snippets of DNA, making it difficult to model long-distance dependencies that arise from DNA's 3-dimensional conformation. In order to study long-distance dependencies, we develop and release …

2017-10-03abs ↗pdf ↗

Improved VGG networks enhance image classification accuracy.

problem Enhancing image classification accuracy using modified VGG architectures.
method Two improved VGG architectures were created by freezing the first two blocks and applying different dilation rates in the last three blocks.
result Significant out-performance on image classification tasks on CIFAR-10 and CIFAR-100 datasets.

The study of which mapping class group elements can be realized as affine automorphisms of dilation surfaces.

problem Which elements of the mapping class group can be realized as affine automorphisms of dilation surfaces?
method Investigation into the affine automorphism groups of dilation surfaces, including the construction of dilation surfaces from multicurves.
result Only certain types of mapping class group elements can arise as affine automorphisms of dilation surfaces.

This paper describes a family of pseudo-Anosov braids with small dilatation. The smallest dilatations occurring for braids with 3, 4 and 5 strands appear in this family. A pseudo-Anosov braid with 2g+1 strands determines a hyperelliptic mapping class with the same dilatation on a genus-g surface. Penner showed that log…

2009-04-03abs ↗pdf ↗

Despite their impressive performance in many tasks, deep neural networks often struggle at relational reasoning. This has recently been remedied with the introduction of a plug-in relational module that considers relations between pairs of objects. Unfortunately, this is combinatorially expensive. In this extended abst…

2018-11-01abs ↗pdf ↗

A new deep learning method for energy disaggregation.

problem Energy disaggregation or non-intrusive load monitoring (NILM) to identify individual appliance power usage.
method Sequence to Point Learning based on Bidirectional Dilated Residual Network (BRDN).
result Our method outperforms state-of-the-art approaches in all appliances on REDD and UK-DALE datasets.

Paper introduces r-DEP classifier for binary classification tasks.

problem No natural ordering for feature patterns in practical situations.
method Introduces reduced dilation-erosion (r-DEP) classifier using multi-valued mathematical morphology.
result r-DEP classifiers outperform traditional SVCs in balanced accuracy.

For any nonorientable closed surface, we determine the minimal dilatation among pseudo-Anosov mapping classes arising from Penner's construction. We deduce that the sequence of minimal Penner dilatations has exactly two accumulation points, in contrast to the case of orientable surfaces where there is only one accumula…

2018-07-24abs ↗pdf ↗

The paper explores inequalities for strongly-convex sets in weighted Riemannian manifolds.

problem Investigating dilation type inequalities on weighted Riemannian manifolds.
method Introducing dilation profile and comparing it with model space under lower weighted Ricci curvature bounds.
result Showed several functional inequalities related to various entropies.

Based on the notion of dilatation structure arXiv:math/0608536, we give an intrinsic treatment to sub-riemannian geometry, started in the paper arXiv:0706.3644 . Here we prove that regular sub-riemannian manifolds admit dilatation structures. From the existence of normal frames proved by Bellaiche we deduce the rest of…

2007-08-31abs ↗pdf ↗

This paper concerns a family of pseudo-Anosov braids with dilatations arbitrarily close to one. The associated graph maps and train tracks have stable "star-like" shapes, and the characteristic polynomials of their transition matrices form Salem-Boyd sequences. These examples show that the logarithms of least dilatatio…

2005-07-01abs ↗pdf ↗

The Hopf invariant is linked to null-homotopy properties of maps.

problem Understanding the relationship between the Hopf invariant and null-homotopy of maps.
method Using the generalized Hopf invariant and constructing smooth null-homotopies, the paper explores the relationship between the Hopf invariant and null-homotopy properties of maps.
result Sharp results on the relationship between the Hopf invariant and null-homotopy properties of maps, showing the necessity and sufficiency of certain conditions.

The key idea of current deep learning methods for dense prediction is to apply a model on a regular patch centered on each pixel to make pixel-wise predictions. These methods are limited in the sense that the patches are determined by network architecture instead of learned from data. In this work, we propose the dense…

2017-05-24abs ↗pdf ↗

This paper explores loss landscapes of sparse neural networks, finding unique characteristics compared to dense networks.

problem Understanding the loss landscape of sparse neural networks, especially one-hidden-layer networks.
method Analyzes sparse networks with dense and sparse final layers, focusing on linear and non-linear models.
result Sparse networks can have no spurious valleys under certain conditions, but spurious valleys and minima can exist for wide sparse networks.

The study improves bounds on pseudo-Anosov maps and certifies minimum and accumulation points of normalized dilatations.

problem Understanding the set of normalized dilatations of fully-punctured pseudo-Anosov maps.
method Improving bounds on the number of tetrahedra in veering triangulations and using computational means.
result Certified that the minimum element of the set of normalized dilatations is μ2μ^2 and the minimum accumulation point is μ4μ^4.

Paper introduces \ell-DER for regression tasks using morphological operators and convex-concave procedure.

problem Developing a universal approximator for regression tasks.
method Introduces \ell-DER model, trains it using a convex-concave procedure (CCP) to minimize least-squares.
result Outperforms other hybrid morphological models and state-of-the-art approaches.