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.
SoccerCPD detects tactical changes in soccer matches using spatiotemporal tracking data.
Role mining tackles the problem of finding a role-based access control (RBAC) configuration, given an access-control matrix assigning users to access permissions as input. Most role mining approaches work by constructing a large set of candidate roles and use a greedy selection strategy to iteratively pick a small subs…
Unified view on selective credit assignment for reinforcement learning.
PEAR dynamically reconfigures agent roles to prevent persistent biases in multi-agent debates.
Eigenoptions improve credit assignment in reinforcement learning.
Intrusion detection systems (IDSs) generate valuable knowledge about network security, but an abundance of false alarms and a lack of methods to capture the interdependence among alerts hampers their utility for network defense. Here, we explore a graph-based approach for fusing alerts generated by multiple IDSs (e.g.,…
Persona2vec learns multiple node roles in graphs.
In this paper we present a novel approach for extracting a Bag-of-Words (BoW) representation based on a Neural Network codebook. The conventional BoW model is based on a dictionary (codebook) built from elementary representations which are selected randomly or by using a clustering algorithm on a training dataset. A me…
Deep learning has achieved impressive prediction accuracies in a variety of scientific and industrial domains. However, the nested non-linear feature of deep learning makes the learning highly non-transparent, i.e., it is still unknown how the learning coordinates a huge number of parameters to achieve a decision makin…
We introduce a notion of measuring scales for quantum abelian gauge systems. At each measuring scale a finite dimensional affine space stores information about the evaluation of the curvature on a discrete family of surfaces. Affine maps from the spaces assigned to finer scales to those assigned to coarser scales play …
Study tackles causal effects of close contact on MRSA infections from entangled treatment data.
Manifold hypotheses are typically used for tasks such as dimensionality reduction, interpolation, or improving classification performance. In the less common problem of manifold estimation, the task is to characterize the geometric structure of the manifold in the original ambient space from a sample. We focus on the r…
We describe the positive cone and the pseudo-effective cone of a non-Kählerian surface. We use these results for two types of applications: - Describe the set of possible total Ricci scalars associated with Gauduchon metrics of fixed volume 1 on a fixed non-Kähhlerian surface, and decide whether the assignment $…
We introduce the notion of Haantjes algebra: It consists of an assignment of a family of operator fields on a differentiable manifold, each of them with vanishing Haantjes torsion. They are also required to satisfy suitable compatibility conditions. Haantjes algebras naturally generalize several known interesting geome…
A new framework assigns values to data points considering their distribution.
SAGE quantifies feature importance in machine learning models.
EgalMAB solves fair resource allocation in stochastic bandits.
Error bounds based on worst likely assignments use permutation tests to validate classifiers. Worst likely assignments can produce effective bounds even for data sets with 100 or fewer training examples. This paper introduces a statistic for use in the permutation tests of worst likely assignments that improves error b…
Assignment methods are at the heart of many algorithms for unsupervised learning and clustering - in particular, the well-known K-means and Expectation-Maximization (EM) algorithms. In this work, we study several different methods of assignment, including the "hard" assignments used by K-means and the ?soft' assignment…
COCOA improves credit assignment in reinforcement learning by measuring contributions to rewards.
Lecture notes on link homologies and knotted surfaces, focusing on 4D obstructions.
NeuroMAS treats multi-agent systems as neural networks for scalable, trainable coordination.
In this short note, we compare the combinatorial sign assignment of Manolescu, Ozsvath, Szabo and Thurston for grid homology of knots and links in 3-sphere with the sign assignment coming from a coherent system of orientations on Whitney disks. Although these constructions produce different signs, a small modification …
In the past few years, deep learning has transformed artificial intelligence research and led to impressive performance in various difficult tasks. However, it is still unclear how the brain can perform credit assignment across many areas as efficiently as backpropagation does in deep neural networks. In this paper, we…
Current methodologies in machine learning analyze the effects of various statistical parity notions of fairness primarily in light of their impacts on predictive accuracy and vendor utility loss. In this paper, we propose a new framework for interpreting the effects of fairness criteria by converting the constrained lo…
New methods optimize personalized treatment assignment in trials with many arms.
Proposes unbiased estimators for training mixture of experts models.
Optimizes balanced treatment assignment for experiments.
The period mapping assigns to each rank n, marked metric graph Gamma a positive definite quadratic form on H_1(Gamma). This defines maps Phi* and Phi on Culler--Vogtmann's outer space CV_n, and its Torelli space quotient T_n, respectively. The map Phi is a free group analog of the classical period mapping that sends a …
The alignment of a set of objects by means of transformations plays an important role in computer vision. Whilst the case for only two objects can be solved globally, when multiple objects are considered usually iterative methods are used. In practice the iterative methods perform well if the relative transformations b…
The success of kernel methods has initiated the design of novel positive semidefinite functions, in particular for structured data. A leading design paradigm for this is the convolution kernel, which decomposes structured objects into their parts and sums over all pairs of parts. Assignment kernels, in contrast, are ob…
New method identifies causal effects with categorical unobserved confounders.
Graph matching plays a central role in such fields as computer vision, pattern recognition, and bioinformatics. Graph matching problems can be cast as two types of quadratic assignment problems (QAPs): Koopmans-Beckmann's QAP or Lawler's QAP. In our paper, we provide a unifying view for these two problems by introducin…
A new Q&A labeling method for assigning labels in machine learning.
Study compares methods for treatment assignment, finding A-learner best for playlist generation.
We consider the problem of learning soft assignments of items to categories given two sources of information: an item-category similarity matrix, which encourages items to be assigned to categories they are similar to (and to not be assigned to categories they are dissimilar to), and an item-item similarity mat…
We consider the problem of efficient credit assignment in reinforcement learning. In order to efficiently and meaningfully utilize new data, we propose to explicitly assign credit to past decisions based on the likelihood of them having led to the observed outcome. This approach uses new information in hindsight, rathe…
Study on optimal rates for sequential probability assignment using smoothed analysis.
Motivation: Untargeted metabolomics comprehensively characterizes small molecules and elucidates activities of biochemical pathways within a biological sample. Despite computational advances, interpreting collected measurements and determining their biological role remains a challenge. Results: To interpret measurement…
Study on knots using 17 colors, finding specific color assignments.
Paper tackles inconsistent CATE estimation across group assignments.
Paper introduces a new text clustering model using Beta-Liouville priors.
This paper studies the problem of inferring a global preference based on the partial rankings provided by many users over different subsets of items according to the Plackett-Luce model. A question of particular interest is how to optimally assign items to users for ranking and how many item assignments are needed to a…
Generative model for joint discrete distributions using randomized assignment flows.
New proof links initial class bias to DNN trainability, challenging traditional understanding.
Study minimax regret in sequential probability assignment with and without side information.
We study how to efficiently estimate average treatment effects (ATEs) using adaptive experiments. In adaptive experiments, experimenters sequentially assign treatments to experimental units while updating treatment assignment probabilities based on past data. We start by defining the efficient treatment-assignment prob…
In this paper we study speaker linking (a.k.a.\ partitioning) given constraints of the distribution of speaker identities over speech recordings. Specifically, we show that the intractable partitioning problem becomes tractable when the constraints pre-partition the data in smaller cliques with non-overlapping speakers…