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

175350524699 · Jun 202019922001200920172026
48 results for 1D linear classification

Improved robustness of 1D CNNs for heart arrhythmia classification.

problem Improving the robustness of 1D CNNs for classification tasks.
method Parameterization using Cayley transform and controllability Gramian for Lipschitz-bounded CNNs.
result Improved robustness of trained Lipschitz-bounded 1D CNNs for heart arrhythmia classification.

Study on the complexity of 1D ReLU neural networks, proving growth in linear regions.

problem Understanding the complexity and expressivity of 1D ReLU neural networks.
method Analyzing the number of linear regions in randomly initialized, fully connected 1D ReLU networks in the infinite-width limit.
result The expected number of linear regions grows as a function of the number of neurons in each layer.

A simple block configures optimal kernel sizes for time series classification.

problem Choosing the right kernel size for time series classification.
method Proposes Omni-Scale block (OS-block) with kernel sizes determined by prime numbers.
result Models with OS-block achieve state-of-the-art performance on time series benchmarks.

CNN improves OSA diagnosis accuracy from PSG data.

problem Manual PSG analysis by specialists is tedious, time-consuming, and prone to errors.
method 1D CNN architecture with convolutional and FCN layers for OSA severity classification.
result Proposed CNN model achieves excellent classification results without manual preprocessing.

Linear RNNs exhibit a bias towards shorter memory due to initialization variance.

problem Understanding the performance limitations of RNNs, especially linear ones.
method Kernel regime analysis to show equivalence to 1D-convolutional networks and analyze weightings.
result Linear RNNs with random initialization have a bias towards shorter memory periods.

The paper proposes an ensemble of convolution-based methods for fault detection in gearboxes.

problem Fault detection in planetary gearboxes using vibration signals.
method Ensemble of three convolution kernel-based methods (ROCKET, 1D CNN with ResNet, FCN).
result Outperforms other approaches with over 98.8% accuracy.

PixelHop++ improves image classification with a smaller model size.

problem Improving image classification models with smaller sizes.
method Decomposing input tensor, channel-wise Saab transform, successive subspace learning, feature ranking.
result PixelHop++ offers a flexible tradeoff between model size and performance.

A new tensor network method for image classification reduces computation cost.

problem Efficiently classifying images in high-dimensional spaces.
method Proposes a multi-layered tensor network (MLTN) that performs one MPS operation per layer, reducing computation cost.
result Reduces computation cost without degrading performance.

Split learning preserves privacy in 1D CNN models for detecting heart abnormalities.

problem Privacy leakage in 1D CNN models under split learning.
method Implemented and validated an 1D CNN model under split learning, applied privacy leakage mitigation techniques.
result Split learning alone is insufficient to maintain raw data privacy in 1D CNN models.

Ridgeless ReLU networks interpolate datasets and extrapolate based on curvature signs.

problem Interpolating and extrapolating 1D datasets with ReLU networks.
method Minimizes 2\ell_2-norm of weights, extrapolates based on curvature signs.
result Ridgeless ReLU interpolants extrapolate as nearest neighbor curvature extrapolation.

SCORE technique reduces BO's high-dimensional search costs.

problem Bayesian optimization's high computational costs in high-dimensional spaces.
method 1D reparametrization trick to maintain linear time complexity.
result Successfully finds global minimum in high-dimensional optimization.

Deep neural networks continue to show improved performance with increasing depth, an encouraging trend that implies an explosion in the possible permutations of network architectures and hyperparameters for which there is little intuitive guidance. To address this increasing complexity, we propose Evolutionary DEep Net…

2017-09-26abs ↗pdf ↗

Gradient descent trains shallow neural networks to approximate functions in 1D.

problem Approximating functions in 1D with shallow neural networks trained by gradient descent.
method Gradient descent optimization of non-convex weight space for finite width networks in 1D.
result Gradient descent can approximate functions in 1D with a minimal number of weights, balancing practical performance and theoretical capabilities.

3D topological order linked to Seifert manifolds and gauge groups.

problem Classifying 3D topological orders using Seifert manifolds and gauge groups.
method Correspondence between topological order, Seifert manifolds, and ADE gauge groups.
result Construction of modular fusion categories from Seifert manifolds and gauge groups.

We call a learner super-teachable if a teacher can trim down an iid training set while making the learner learn even better. We provide sharp super-teaching guarantees on two learners: the maximum likelihood estimator for the mean of a Gaussian, and the large margin classifier in 1D. For general learners, we provide a …

2018-02-25abs ↗pdf ↗

Supervised dimensionality reduction has emerged as an important theme in the last decade. Despite the plethora of models and formulations, there is a lack of a simple model which aims to project the set of patterns into a space defined by the classes (or categories). To this end, we set up a model in which each class i…

2016-10-27abs ↗pdf ↗

Connectedness proved for Zd\mathbb{Z}^d actions on 1D manifolds by C2C^2 diffeomorphisms.

problem Connectedness of Zd\mathbb{Z}^d actions by C2C^2 diffeomorphisms on 1D manifolds.
method Proved connectedness through continuous paths of C1+acC^{1+ac} diffeomorphisms.
result Connectedness of Zd\mathbb{Z}^d actions by C2C^2 diffeomorphisms on 1D manifolds.

Study shows how 3+1D cosmologies can evolve to de Sitter space under certain conditions.

problem Understanding the evolution of 3+1D cosmologies with specific symmetry constraints.
method Mean Curvature Flow methods applied to cosmologies with positive cosmological constant and specific symmetry groups.
result Asymptotically, 3+1D cosmologies evolve to de Sitter space under certain conditions.

HybridSGD improves SGD performance by balancing computation and communication.

problem Limited scalability and performance of SGD due to communication costs.
method 2D parallel SGD method (HybridSGD) that trades off between 1D ss-step SGD and 1D Federated SGD (FedAvg).
result HybridSGD achieves better convergence than FedAvg at similar processor scales and up to 121x speedup over FedAvg.

New method uses neural networks to interpolate stellar atmospheres with high precision.

problem Recover precise stellar model atmospheres from grids of models.
method Deep neural network with 1D convolutional auto-encoder for feature extraction.
result Higher precision compared to traditional methods.

Estimates reliability of nuclear fuel using advanced modeling techniques.

problem Determining the reliability of TRISO-coated particle fuel, which has small failure probabilities and expensive computational models.
method Coupled active learning, multifidelity modeling, and subset simulation.
result Multifidelity modeling strategies consistently reduce the number of high-fidelity model calls.

Master thesis applies deep learning to sEMG hand gesture recognition, improving accuracy.

problem Reliability issues in sEMG-based hand gesture recognition due to motion artefacts and variability.
method Used deep learning on Unibo-INAIL dataset, collecting data over 8 sessions of 7 subjects.
result Deep learning architecture yields 81.2% inter-posture test accuracy and 75.9% inter-day test accuracy.

Paper extends multi-task Gaussian Cox processes for heterogeneous tasks.

problem Modeling multiple heterogeneous correlated tasks jointly.
method Data augmentation and mean-field approximation for non-conjugate Bayesian inference.
result Demonstrates improved performance and inference on synthetic and real data.

Study shows inflation in 3+1D cosmologies with bounded scalar potential and specific symmetry.

problem Understanding inflation in 3+1D cosmologies with specific constraints.
method Mean curvature flow and asymptotic analysis of metric variations, stress-energy tensor, and inflaton field dynamics.
result Inflation occurs in 3+1D cosmologies with specific constraints, demonstrating it is possible with inhomogeneous initial conditions.

Morphological neurons, that is morphological operators such as dilation and erosion with learnable structuring elements, have intrigued researchers for quite some time because of the power these operators bring to the table despite their simplicity. These operators are known to be powerful nonlinear tools, but for a gi…

2019-01-01abs ↗pdf ↗

Estimates latent positions in 1D torus from noisy pairwise affinities.

problem Estimating latent positions in a 1D torus from noisy pairwise affinities.
method Introduced an estimation procedure with provable localization error of O(log(n)/n)O(\sqrt{\log(n)/n}).
result The estimation procedure provably localizes latent positions with a maximum error of O(log(n)/n)O(\sqrt{\log(n)/n}).

This study analyzes a non-orientable spacetime model in 1+1D quantum gravity.

problem Analyzing a non-orientable spacetime model in 1+1D quantum gravity.
method Formulated a Jackiw-Teitelboim gravity toy model on the Möbius band, computed Stiefel-Whitney classes, and analyzed the Dirac operator.
result Half-integer momentum quantization, spectral symmetry, vanishing mod-2 index, and η_D(0) = 0 follow.

Capsule networks excel in understanding spatial relationships in 2D data for vision related tasks. Even though they are not designed to capture 1D temporal relationships, with TimeCaps we demonstrate that given the ability, capsule networks excel in understanding temporal relationships. To this end, we generate capsule…

2019-11-26abs ↗pdf ↗

The identification of novel drug-target (DT) interactions is a substantial part of the drug discovery process. Most of the computational methods that have been proposed to predict DT interactions have focused on binary classification, where the goal is to determine whether a DT pair interacts or not. However, protein-l…

2018-01-30abs ↗pdf ↗

In this paper, we present an acoustic scene classification framework based on a large-margin factorized convolutional neural network (CNN). We adopt the factorized CNN to learn the patterns in the time-frequency domain by factorizing the 2D kernel into two separate 1D kernels. The factorized kernel leads to learn the m…

2019-10-14abs ↗pdf ↗

IETNet identifies important channels for MVTS classification.

problem Multivariate time series classification with blackbox deep networks.
method End-to-end network combining temporal feature extraction, variable selection, and interaction.
result IETNet improves model accuracy and reduces overfitting by identifying and removing non-predictive variables.