arXiv research

New method quantifies multivariate redundancy using maximum entropy decompositions.

Liquid chromatography coupled with tandem mass spectrometry, also known as shotgun proteomics, is a widely-used high-throughput technology for identifying proteins in complex biological samples. Analysis of the tens of thousands of fragmentation spectra produced by a typical shotgun proteomics experiment begins by assi…

The paper introduces a method to explain redundancy in deep CNNs using unit impulse response.

Redundancy improves learning stability and generalization in structured systems.

New method quantifies redundant information using information bottleneck.

Transformers reduce redundancy by focusing on invariant relational quantities.

Study shows DNNs often extract redundant features, influenced by network size and activation function.

Paper proposes redundancy-free features for zero-shot object recognition.

This work explains scaling laws as redundancy laws in deep learning.

Study on neural networks to identify redundancy issues in safe machine learning.

Study finds 10% redundant images in image classification datasets.

Clustering helps reduce spatial data size by identifying redundant points.

We simplify SSL by approximating redundant structural components with low-rank factorization.

This paper introduces a new measure to identify model redundancy in compressed CNNs.

This paper explores how optimizing data access and reducing redundancy can improve machine learning algorithm performance.

Hybrid subgroups found in non-arithmetic PU(2,1) lattices.

New non-arithmetic lattice found in PU(3,1)

Optimized GPRNN reduces model complexity and overfitting, improving performance.

One of Powell's generators is not necessary.

The study analyzes optimization trajectories in neural networks to reveal redundancy and redundancy-reducing strategies.

New property identifies arithmetic lattices from nonuniform lattices.

This work introduces RISE to explain LLMs more reliably by distinguishing essential context.

This work identifies redundant tests in conditional-independence-based discovery that can improve graphical model accuracy.

Contrastive learning works well with redundant data views.

New lattice stick knot condition identified.

Simplified proof for lattice link projections.

DETOX improves distributed training resilience with redundancy and robust aggregation.

This work compares lattice-free and lattice-based training criteria for LVCSR.

Research finds bounds for knots in hexagonal lattice and classifies 11-stick knots.

This paper explains adversarial examples as feature redundancy abuse.

We outline the theory of sets with distributive operations: multishelves and multispindles, with examples provided by semi-lattices, lattices and skew lattices. For every such a structure we define multi-term distributive homology and show some of its properties. The main result is a complete formula for the homology o…

Course on arithmetic lattices at EPFL.

New lattices from 4-manifolds show manifold properties.

Upper bound for lattice stick number of spatial graphs.

Study on how deterministic dependencies affect information synergy and redundancy.

New thin subgroups found in special linear groups via bending techniques.

New rigidity theorem for product of lattices.

This paper studies the covolumes of nonuniform arithmetic lattices in PU(n, 1). We determine the smallest covolume nonuniform arithmetic lattices for each n, the number of minimal covolume lattices for each n, and study the growth of the minimal covolume as n varies. In particular, there is a unique lattice (up to conj…

The paper finds incommensurable lattices in complex models of Baumslag-Solitar groups.

Proves a lattice version of the Atiyah-Singer index theorem.

New method distinguishes feature relevance in non-linear contexts.

Vertex distortion measures how far lattice knots deviate from straight lines.

Regular integer lattices are characterized by k unit vectors that build up their generator matrices. These have rank k for D-lattices, and are rank-deficient for A-lattices, for E_6 and E_7. We count lattice points inside hypercubes centered at the origin for all three types, as if classified by maximum infinity norm i…

The paper proves residual finiteness of certain lattices and constructs surfaces with specific fundamental groups.

Proves properties of arithmetic lattices and hyperbolic manifolds.

A celebrated theorem of Hadwiger states that the Euler-Poincaré characteristic is the the unique invariant and continuous valuation on the distributive lattice of compact polyhedra in R^n that assigns value one to each convex non-empty such polyhedron. This paper provides an analogue of Hadwiger's result for finitely p…

Paper compresses deep neural networks by eliminating redundant neurons.

FactorMiner discovers financial alpha factors with low redundancy.