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.
Convolutional neural networks converge quickly with gradient descent.
GSP improves global average pooling for deep metric learning by learning weights and selecting semantic entities.
Tensor regression networks achieve high compression rate of neural networks while having slight impact on performances. They do so by imposing low tensor rank structure on the weight matrices of fully connected layers. In recent years, tensor regression networks have been investigated from the perspective of their comp…
This paper explores two techniques to improve the performance of text-dependent speaker verification systems based on deep neural networks. Firstly, we propose a general alignment mechanism to keep the temporal structure of each phrase and obtain a supervector with the speaker and phrase information, since both are rel…
Compared with global average pooling in existing deep convolutional neural networks (CNNs), global covariance pooling can capture richer statistics of deep features, having potential for improving representation and generalization abilities of deep CNNs. However, integration of global covariance pooling into deep CNNs …
Most of the research in convolutional neural networks has focused on increasing network depth to improve accuracy, resulting in a massive number of parameters which restricts the trained network to platforms with memory and processing constraints. We propose to modify the structure of the Very Deep Convolutional Neural…
Recent research shows that for training with loss, convolutional neural networks (CNNs) whose width (number of channels in convolutional layers) goes to infinity correspond to regression with respect to the CNN Gaussian Process kernel (CNN-GP) if only the last layer is trained, and correspond to regression wit…
In most convolution neural networks (CNNs), downsampling hidden layers is adopted for increasing computation efficiency and the receptive field size. Such operation is commonly so-called pooling. Maximation and averaging over sliding windows (max/average pooling), and plain downsampling in the form of strided convoluti…
We propose a simple but strong baseline for time series classification from scratch with deep neural networks. Our proposed baseline models are pure end-to-end without any heavy preprocessing on the raw data or feature crafting. The proposed Fully Convolutional Network (FCN) achieves premium performance to other state-…
Tiled Squeeze-and-Excite improves channel attention with local spatial context.
Convolutional neural networks (CNNs) have achieved remarkable performance in many applications, especially in image recognition tasks. As a crucial component of CNNs, sub-sampling plays an important role for efficient training or invariance property, and max-pooling and arithmetic average-pooling are commonly used sub-…
The paper reformulates U-Nets as wavelet-based models and applies this to hierarchical VAEs.
Capitalizing on the need for addressing the existing challenges associated with gesture recognition via sparse multichannel surface Electromyography (sEMG) signals, the paper proposes a novel deep learning model, referred to as the XceptionTime architecture. The proposed innovative XceptionTime is designed by integrati…
A longstanding goal in the theory of deep learning is to characterize the conditions under which a given neural network architecture will be trainable, and if so, how well it might generalize to unseen data. In this work, we provide such a characterization in the limit of very wide and very deep networks, for which the…
New CNN initialization scheme derived from modern architectures.
Fully Convolutional Neural Networks (F-CNNs) achieve state-of-the-art performance for segmentation tasks in computer vision and medical imaging. Recently, computational blocks termed squeeze and excitation (SE) have been introduced to recalibrate F-CNN feature maps both channel- and spatial-wise, boosting segmentation …
In this paper, we propose Broad Neural Architecture Search (BNAS) where we elaborately design broad scalable architecture dubbed Broad Convolutional Neural Network (BCNN) to solve the above issue. On one hand, the proposed broad scalable architecture has fast training speed due to its shallow topology. Moreover, we als…
Spatial smoothing improves BNNs' accuracy, uncertainty, and robustness without increasing computational cost.
New models exploit invariance to reduce model complexity.
New kernels boost RNN performance on non-time-series data.
Deep learning has thrived by training on large-scale datasets. However, in robotics applications sample efficiency is critical. We propose a novel adaptive masked proxies method that constructs the final segmentation layer weights from few labelled samples. It utilizes multi-resolution average pooling on base embedding…
New kernels from neural networks show better performance than traditional methods.
Colorectal cancer, largely arising from precursor lesions called polyps, remains one of the leading causes of cancer-related death worldwide. Current clinical standards require the resection and histopathological analysis of polyps due to test accuracy and sensitivity of optical biopsy methods falling substantially bel…
We seek to improve deep neural networks by generalizing the pooling operations that play a central role in current architectures. We pursue a careful exploration of approaches to allow pooling to learn and to adapt to complex and variable patterns. The two primary directions lie in (1) learning a pooling function via (…
We propose a random convolutional neural network to generate a feature space in which we study image classification and retrieval performance. Put briefly we apply random convolutional blocks followed by global average pooling to generate a new feature, and we repeat this k times to produce a k-dimensional feature spac…
Convolution and pooling improve kernel methods in image classification.
Unified framework for U-Net design and analysis.
In modern computer vision tasks, convolutional neural networks (CNNs) are indispensable for image classification tasks due to their efficiency and effectiveness. Part of their superiority compared to other architectures, comes from the fact that a single, local filter is shared across the entire image. However, there a…
Sound event detection (SED) methods are tasked with labeling segments of audio recordings by the presence of active sound sources. SED is typically posed as a supervised machine learning problem, requiring strong annotations for the presence or absence of each sound source at every time instant within the recording. Ho…
LipKernel adds robustness to CNNs by enforcing Lipschitz bounds.
Deep neural-kernel models combine neural networks and kernel machines for scalable large datasets.
This thesis explores GNNs, categorizing them into local and global approaches.
Generalizes global hyperbolicity to higher signatures and proves compactness.
Global methods outperform local in forecasting groups of time series, even in heterogeneous datasets.
In this note a proof is given for global existence and uniqueness of minimal surfaces of Lorentzian type from a cylinder into globally hyperbolic Lorentzian manifolds for given initial values up to the first derivatives.
New spacetimes found that are refocusing but not strongly refocusing.
Global and local blowups of manifolds are proven equivalent.
Global calculus for manifolds with boundary, solving evolution problems.
Study calculates global sections on complex curves.
Smooth convergence shown for curve diffusion flows.
We prove the global existence of Dirac-wave maps with curvature term with small initial data on globally hyperbolic manifolds of arbitrary dimension which satisfy a suitable growth condition. In addition, we also prove a global existence result for wave maps under similar assumptions.
Global optimization in Bayesian inference yields little additional benefit.
Combines global and local search for efficient global optimization with Gaussian processes.
Global implicit function theorem for Fréchet spaces, solving derivative loss problems.
New global section found for geodesic flows on convex hypersurfaces.
Improves global counterfactual explanations for model recourse.
We show global existence and convergence results for the pluriclosed flow on manifolds for which certain naturally associated tensor bundles are globally generated.
Graph products inherit Morse local-to-global property from their components.