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

count % of corpus

4 results for “Permutation-Equivalence”

How to Shrink Confidence Sets for Many Equivalent Discrete Distributions?stat.ML

We shrink confidence sets for equivalent discrete distributions using permutation equivalence.

problem Building high-probability confidence sets for equivalent discrete distributions.

method Exploiting permutation-equivalence to refine confidence sets.

result Confidence sets shrink at asymptotic rates of

O(1/\sqrt{\sum_{k\in \mathcal K} n_k})

and

O(1/\max_{k\in K} n_{k})

Confidence Sets Permutation-Equivalence Machine Learning High-Probability Bounds Reinforcement Learning

2024-07-22abs ↗pdf ↗

Near-Optimal Experiment Design in Linear non-Gaussian Cyclic Modelsstat.ML

Optimizes experiment design for causal structure learning in linear models with cycles.

problem Causal structure learning from combined observational and interventional data in linear non-Gaussian cyclic models.

method Combinatorial characterization of equivalence classes, adaptive stochastic optimization, greedy policy with near-optimal performance guarantee, sampling-based estimator for reward function.

result Optimal experiment design reduces the equivalence class of causal graphs to a single true graph with a small number of interventions.

causal inference experiment design linear models non-Gaussian cyclic models

2025-09-25abs ↗pdf ↗

Learning to Encode Position for Transformer with Continuous Dynamical Modelcs.LG

New method for Transformer models to encode position information without sequential bias.

problem Lack of flexible and learnable position encoding for Transformer models.

method Continuous dynamical model to learn position encoding.

result Consistent improvements over baselines in various NLP tasks.

Transformer Position Encoding Continuous Dynamical Model Neural ODE Machine Translation

2020-03-13abs ↗pdf ↗

Symmetric Sparse Boolean Matrix Factorization and Applicationscs.LG

We develop a method to factorize symmetric sparse Boolean matrices efficiently.

problem Finding a symmetric factorization of a given matrix into a sparse, Boolean matrix.

method Polynomial-time algorithm based on bootstrapping higher-order information and tensor decomposition.

result A matrix with full column rank can be recovered with high probability when the matrix size is sufficiently large.

Matrix Factorization Boolean Matrix Sparse Matrix Polynomial-Time Algorithm Hypergraph Reconstruction

2021-02-02abs ↗pdf ↗