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

19385776 · May 202619922001200920172026
48 results for Intra-class Concentration

This work explores the relationship between expressivity and generalization in GNNs.

problem Understanding the trade-off between expressivity and generalization in GNNs.
method Introducing a novel framework that connects GNN generalization to the variance in graph structures they can capture.
result Theoretical findings align with empirical results, offering a deeper understanding of how expressivity enhances GNN generalization.

The margin-based softmax loss functions greatly enhance intra-class compactness and perform well on the tasks of face recognition and object classification. Outperformance, however, depends on the careful hyperparameter selection. Moreover, the hard angle restriction also increases the risk of overfitting. In this pape…

2019-12-17abs ↗pdf ↗

D-CBRS manages memory for continual learning by accounting for intra-class diversity.

problem Forgetting in continual learning, especially with class-imbalanced data.
method D-CBRS introduces a novel approach to store instances in memory, considering intra-class diversity.
result D-CBRS outperforms existing methods on data sets with intra-class diversity.

This paper refines MMD for domain adaptation by balancing intra-class and inter-class distances.

problem Balancing intra-class and inter-class distances for better feature discriminability in domain adaptation.
method The paper theoretically proves two facts about MMD and proposes a novel discriminative MMD method to balance intra-class and inter-class distances.
result The proposed method improves feature discriminability and outperforms state-of-the-art methods.

This paper proposes a novel generic one-class feature learning method based on intra-class splitting. In one-class classification, feature learning is challenging, because only samples of one class are available during training. Hence, state-of-the-art methods require reference multi-class datasets to pretrain feature …

2018-12-20abs ↗pdf ↗

New bounds improve graph node classification using optimal transport.

problem Improving transductive generalization bounds for graph node classification.
method Representation-based generalization bounds via optimal transport, expressed in terms of Wasserstein distances.
result Strong correlation between derived bounds and empirical generalization in graph node classification.

PortBench benchmarks LLMs for PM, revealing their weaknesses in diversification and robustness.

problem Lack of benchmarks for LLM-driven portfolio management, especially in diversification and robustness.
method Developed a comprehensive benchmark with a static QA dataset and a dynamic allocation pipeline, introducing metrics to evaluate correlation and robustness.
result 90% of LLMs fail to outperform a basic equal-weight allocation, highlighting their limitations in diversification and robustness.

In this paper, we focus on the separability of classes with the cross-entropy loss function for classification problems by theoretically analyzing the intra-class distance and inter-class distance (i.e. the distance between any two points belonging to the same class and different classes, respectively) in the feature s…

2019-09-16abs ↗pdf ↗

Inner product-based convolution has been a central component of convolutional neural networks (CNNs) and the key to learning visual representations. Inspired by the observation that CNN-learned features are naturally decoupled with the norm of features corresponding to the intra-class variation and the angle correspond…

2018-04-22abs ↗pdf ↗

This paper proposes a method to use deep neural networks as end-to-end open-set classifiers. It is based on intra-class data splitting. In open-set recognition, only samples from a limited number of known classes are available for training. During inference, an open-set classifier must reject samples from unknown class…

2019-03-12abs ↗pdf ↗

Proposes GM Score to evaluate GANs considering diversity, disentanglement, and discriminability.

problem Evaluation of GANs for sample quality and diversity.
method Integrates various factors including intra-class and inter-class diversity, disentanglement, and discriminability metrics.
result Demonstrates improved evaluation of GANs on MNIST dataset.

COBRA reduces modality gap in cross-modal tasks.

problem Joint embedding spaces fail to sufficiently reduce modality gap in multi-modal tasks.
method COBRA trains image and text modalities in a joint fashion using Contrastive Predictive Coding and Noise Contrastive Estimation.
result COBRA significantly reduces the modality gap and generates robust joint-embedding space.

New theory explains contrastive learning via overlapping augmented views.

problem Lack of theoretical understanding of contrastive learning.
method Augmentation overlap perspective to improve downstream performance.
result Asymptotically closed bounds for downstream performance under weaker assumptions.

In this paper we propose the use of multiple local binary patterns(LBPs) to effectively classify land use images. We use the UC Merced 21 class land use image dataset. Task is challenging for classification as the dataset contains intra class variability and inter class similarities. Our proposed method of using multi-…

2019-02-07abs ↗pdf ↗

PSC classifier improves HDLSS classification on class-imbalanced data.

problem Classification on high-dimension low-sample-size data with class imbalance.
method Population Structure-learned Classifier (PSC) maximizing inter-class and intra-class scatter matrices.
result PSC outperforms state-of-the-art methods on IHDLSS.

AdaCAD improves semi-supervised classification by focusing on intra-class nodes.

problem Improving semi-supervised classification by addressing inter-class connections in graphs.
method AdaCAD uses a class-attentive diffusion process to adaptively aggregate nodes based on their class similarity.
result AdaCAD significantly outperforms state-of-the-art methods in semi-supervised classification.

Paper addresses concentration of distances for fractional quasi p-norms, identifying conditions for concentration and anti-concentration.

problem Understanding concentration of distances for fractional quasi p-norms in high dimensions.
method Analyzes conditions for concentration and anti-concentration of distances for fractional quasi p-norms.
result Identifies conditions for concentration and anti-concentration of fractional quasi p-norms, ruling out some approaches and specifying conditions for control.

Study Finsler metric measure manifolds' concentration properties.

problem Understanding concentration properties in Finsler metric measure manifolds.
method Established relationships with observable diameter, isoperimetric inequalities, and first eigenvalue.
result Derived a Cheng type upper bound estimate for the first closed eigenvalue.

We survey recent results related to the concentration of eigenfunctions. We also prove some new results concerning ball-concentration, as well as showing that eigenfunctions saturating lower bounds for L1L^1-norms must also, in a measure theoretical sense, have extreme concentration near a geodesic.

2015-10-26abs ↗pdf ↗

Study on volume of tubes and concentration in Riemannian geometry.

problem Understanding concentration loci in Riemannian manifolds and their relation to tube volumes.
method Provided a general formula for tube volumes, specialized to totally geodesic submanifolds, and investigated concentration loci.
result Explicitly proved concentration for codimension one cases and explored characterizations in Wasserstein and Box distances.

Polluting fine dusts in South Korea which are mainly consisted of biomass burning and fugitive dust blown from dust belt is significant problem these days. Predicting concentrations of fine dust particles in Seoul is challenging because they are product of complicate chemical reactions among gaseous pollutants and also…

2019-01-29abs ↗pdf ↗

This study assesses risk concentration in MDB portfolios using Monte Carlo simulations.

problem Risk concentration in MDB portfolios of a few borrowers.
method Realistic MDB portfolio simulations and Monte Carlo analysis.
result Current risk adjustments may be overly conservative.

A limit point p of a discrete group of Mobius transformations acting on S^n is called a concentration point if for any sufficiently small connected open neighborhood U of p, the set of translates of U contains a local basis for the topology of S^n at p. For the case of Fuchsian groups (n = 1), every concentration point…

1998-06-23abs ↗pdf ↗

New approach to concentration inequalities for unbounded state space dynamical systems.

problem Concentration inequalities for unbounded state space dynamical systems.
method Functional analytic framework, transport-entropy inequality.
result Exponential concentration inequalities for sampling from stationary distribution.