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,657 papers · 148 categories

Trend · papers per month

2457 · Jul 202019922001200920172026
48 results for downsampling

Optimal downsampling improves GLM performance in imbalanced classification.

problem Improving GLM performance in imbalanced classification.
method Proposed a pseudo maximum likelihood estimator for optimal downsampling.
result The introduced estimator outperforms existing alternatives in both synthetic and empirical data.

Downsampling can improve generalization in ridgeless linear regression, especially with optimal sketching size.

problem Improving generalization in ridgeless linear regression with limited data.
method Investigating the effects of downsampling on the sketched ridgeless least square estimator in the proportional regime.
result Optimal sketching size minimizes out-of-sample prediction risks and stabilizes risk curves.

We reduce training time in convolutional networks (CNNs) with a method that, for some of the mini-batches: a) scales down the resolution of input images via downsampling, and b) reduces the forward pass operations via pooling on the convolution filters. Training is performed in an interleaved fashion; some batches unde…

2019-10-15abs ↗pdf ↗

Advanced methods of applying deep learning to structured data such as graphs have been proposed in recent years. In particular, studies have focused on generalizing convolutional neural networks to graph data, which includes redefining the convolution and the downsampling (pooling) operations for graphs. The method of …

2019-04-17abs ↗pdf ↗

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…

2018-10-07abs ↗pdf ↗

A hybrid ASR system using conformer architecture improves word-error-rate and training speed.

problem Improving word-error-rate and training efficiency for hybrid ASR systems.
method Used conformer architecture, applied time downsampling, and transposed convolutions.
result Conformer-based hybrid model achieves competitive results and significantly outperforms BLSTM-based hybrid model.

ThriftyNet uses a single convolutional layer recursively to maximize parameter usage.

problem Maximizing the use of parameters in deep convolutional neural networks.
method A single convolutional layer is used recursively, with normalization, non-linearities, downsampling, and shortcuts to maintain model expressivity.
result ThriftyNet achieves competitive performance with significantly fewer parameters.

DNArch learns CNN architectures by backpropagation.

problem Discovering optimal CNN architectures.
method Differentiable Neural Architectures (DNArch) learns CNN architectures by backpropagation, controlling kernel sizes, channels, downsampling positions, and depth.
result DNArch finds performant CNN architectures across various tasks.

In this brief technical report we introduce the CINIC-10 dataset as a plug-in extended alternative for CIFAR-10. It was compiled by combining CIFAR-10 with images selected and downsampled from the ImageNet database. We present the approach to compiling the dataset, illustrate the example images for different classes, g…

2018-10-02abs ↗pdf ↗

HKT improves sequence processing with multi-scale attention and kernel analysis.

problem Processing sequences at multiple scales with efficient attention mechanisms.
method Trainable causal downsampling and convex weights for level-specific score matrices.
result HKT achieves consistent gains over standard attention across various tasks.

Study reveals significant performance flips in GLOD using repurposed graph classification datasets.

problem Performance discrepancies in graph-level outlier detection using repurposed classification datasets.
method Repurposed binary classification datasets for GLOD; analyzed ROC-AUC performance.
result Performance of GLOD models significantly flips depending on which class is down-sampled.

RAD improves robustness to domain annotation noise without explicit domain annotations.

problem Robustness to domain annotation noise in training data.
method Regularized Annotation of Domains (RAD) for last layer retraining.
result RAD outperforms state-of-the-art methods even with 5% noise in training data.

Graph convolutional neural networks (Graph-CNNs) extend traditional CNNs to handle data that is supported on a graph. Major challenges when working with data on graphs are that the support set (the vertices of the graph) do not typically have a natural ordering, and in general, the topology of the graph is not regular …

2018-11-28abs ↗pdf ↗

A new tensor-based layer reduces neural network dimensions without losing important features.

problem Reducing dimensionality in tensor-structured feature data for deep neural networks.
method TensorProjection layer that projects input tensors into output tensors with reduced dimensions through mode-wise projections.
result The TensorProjection layer outperforms traditional downsampling methods in tasks like medical image classification and segmentation.

The paper verifies deep neural networks' ability to approximate functions on spheres.

problem Theoretical verification of deep neural networks' performance on spherical functions.
method Spherical analysis using reproducing kernels and convolutional factorizations.
result Rates of uniform approximation for functions in Sobolev spaces and additive ridge forms.

Electronic records contain sequences of events, some of which take place all at once in a single visit, and others that are dispersed over multiple visits, each with a different timestamp. We postulate that fine temporal detail, e.g., whether a series of blood tests are completed at once or in rapid succession should n…

2019-04-27abs ↗pdf ↗

Recent advances in representation learning on graphs, mainly leveraging graph convolutional networks, have brought a substantial improvement on many graph-based benchmark tasks. While novel approaches to learning node embeddings are highly suitable for node classification and link prediction, their application to graph…

2018-11-03abs ↗pdf ↗

Convolution and pooling improve kernel methods in image classification.

problem Understanding the interplay between approximation and generalization in convolutional architectures.
method Characterized RKHS of kernels with convolution, pooling, and downsampling, computed generalization error.
result Convolution and pooling operations trade off approximation with generalization power.

This paper develops efficient bounds on the Wasserstein metric for discrete measures.

problem Computing the exact Wasserstein metric is computationally expensive.
method Formulates and solves a Kantorovich problem on a coarse grid using quantized measures and cost matrices, followed by upscaling and correction.
result Achieves a 10x-100x speedup while maintaining low approximation error.

Paper addresses CPA line forecasting in online advertising mid-flight.

problem Forecasting ad campaign performance mid-flight considering bidding mechanisms.
method Generates relationships between metrics and optimization signals, estimates sensitivity, and characterizes advertiser spends vs. eCPA.
result Demonstrates promising accuracy in forecasting against actual deliveries.

Graph Neural Networks (GNNs), which generalize deep neural networks to graph-structured data, have drawn considerable attention and achieved state-of-the-art performance in numerous graph related tasks. However, existing GNN models mainly focus on designing graph convolution operations. The graph pooling (or downsampli…

2019-11-14abs ↗pdf ↗

The paper tackles skeptical binary inferences in multi-label problems with sets of probabilities.

problem Making distributionally robust, skeptical inferences for multi-label problems.
method Study of distributionally robust, skeptical inferences for multi-label problems using Hamming loss.
result Skeptical inferences provide partial predictions for a sufficiently big set of probability distributions.

The paper tackles imbalance in production data by proposing sampling methods to improve model performance on underrepresented observations.

problem Imbalance in production data negatively impacts model predictive performance on underrepresented observations.
method Three sampling approaches are investigated to adjust for imbalance in training data and improve model performance.
result Fitting a model using sampled data yields a small reduction in overall predictive performance but a better performance on underrepresented observations.

Spectral Independence Criterion helps infer cause-effect relationships in time series.

problem Distinguishing cause from effect in time series data.
method Spectral Independence Criterion (SIC) based on PSD and frequency response.
result SIC provides a robust method for causal inference in time series data.