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

Trend · papers per month

336698131 · Jun 202019922001200920172026
48 results for role assignment

SoccerCPD detects tactical changes in soccer matches using spatiotemporal tracking data.

problem Detecting consistent team formations in fluid sports like soccer.
method Two-step change-point detection: formation and role changes.
result Accurately detects tactical changes and estimates formation and role assignments.

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…

2012-12-19abs ↗pdf ↗

PEAR dynamically reconfigures agent roles to prevent persistent biases in multi-agent debates.

problem Persistent positional biases and sensitivity to role assignments in fixed topologies.
method Dynamic reconfiguration of agent roles and sparse topologies based on evolving agent states.
result Significantly improves average accuracy over debate baselines across multiple reasoning benchmarks.

Eigenoptions improve credit assignment in reinforcement learning.

problem Improving credit assignment in reinforcement learning models.
method Investigated eigenoptions for credit assignment in model-free RL, comparing pre-specified and online discovery methods.
result Pre-specified eigenoptions aid exploration and credit assignment, while online discovery can hinder 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.,…

2018-12-06abs ↗pdf ↗

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…

2020-01-10abs ↗pdf ↗

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 …

2011-01-20abs ↗pdf ↗

Study tackles causal effects of close contact on MRSA infections from entangled treatment data.

problem Estimating causal effects of close contact on MRSA infections from observational data with entangled treatments.
method NEAT method that models treatment assignment mechanism and mitigates confounding biases.
result NEAT method effectively estimates causal effects 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…

2019-06-18abs ↗pdf ↗

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 σ(X)σ(X) 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 $…

2007-04-23abs ↗pdf ↗

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…

2017-10-12abs ↗pdf ↗

SAGE quantifies feature importance in machine learning models.

problem Understanding the role of individual features in complex models.
method Formalizing predictive power through model-based and universal measures, and introducing SAGE for efficient calculation.
result SAGE assigns more accurate feature importance values than other methods.

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…

2015-03-31abs ↗pdf ↗

COCOA improves credit assignment in reinforcement learning by measuring contributions to rewards.

problem Improving sample efficiency in reinforcement learning through better credit assignment methods.
method Counterfactual Contribution Analysis (COCOA) for precise credit assignment.
result COCOA achieves lower bias and variance compared to Hindsight Credit Assignment (HCA), improving reinforcement learning performance.

Lecture notes on link homologies and knotted surfaces, focusing on 4D obstructions.

problem Understanding knotted surfaces using link homology theories.
method Overview of link homology theories, introduction to Khovanov homology, and computational techniques.
result New insights into the homomorphisms assigned to link cobordisms for knotted surfaces.

NeuroMAS treats multi-agent systems as neural networks for scalable, trainable coordination.

problem Designing multi-agent systems as hand-designed workflows is inefficient and inflexible.
method NeuroMAS treats multi-agent systems as a neural network architecture with reinforcement learning for scalable coordination.
result NeuroMAS improves significantly over multi-agent baselines and can be scaled progressively.

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 …

2018-12-06abs ↗pdf ↗

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…

2018-07-03abs ↗pdf ↗

New methods optimize personalized treatment assignment in trials with many arms.

problem Poor performance of standard methods in trials with many treatment arms.
method Regularized and clustered joint assignment forest algorithm.
result Gains in predicting arm-wise outcomes and utility gains from personalization.

Proposes unbiased estimators for training mixture of experts models.

problem Efficiently training large-scale mixture of experts models on modern hardware.
method Two unbiased estimators based on principled stochastic assignment procedures.
result Both estimators are more effective and robust than biased alternatives.

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 …

2016-09-12abs ↗pdf ↗

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…

2014-10-30abs ↗pdf ↗

New method identifies causal effects with categorical unobserved confounders.

problem Estimating causal effects in the presence of unobserved confounders.
method Mixture learning and tensor decomposition for consistent estimation.
result Causal effects are identifiable with categorical unobserved confounders under suitable conditions.

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…

2019-11-25abs ↗pdf ↗

Study compares methods for treatment assignment, finding A-learner best for playlist generation.

problem Treatment assignment in various applications.
method Three classes of algorithms: O-learner, E-learner, A-learner.
result Optimizing for outcomes or causal effects does not lead to optimal treatment assignments.

We consider the problem of learning soft assignments of NN items to KK 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…

2014-05-23abs ↗pdf ↗

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…

2019-12-05abs ↗pdf ↗

Study on optimal rates for sequential probability assignment using smoothed analysis.

problem Optimal rates for sequential probability assignment under smoothed adversaries.
method General-purpose reduction from minimax rates to transductive learning, development of an efficient algorithm using MLE oracle.
result Optimal (logarithmic) fast rates for parametric and finite VC dimension classes, sublinear regret for general classes.

Paper introduces a new text clustering model using Beta-Liouville priors.

problem Clustering short text data.
method Develops a hierarchical mixture model with Beta-Liouville priors for short text clustering.
result The Beta-Liouville distribution offers a more flexible correlation structure for short text clustering.

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…

2014-06-21abs ↗pdf ↗

Generative model for joint discrete distributions using randomized assignment flows.

problem Efficiently representing and sampling from complex joint distributions of discrete variables.
method Randomized assignment flows on the statistical submanifold of factorizing distributions.
result Our model can efficiently represent and sample from any target distribution and assess likelihood of unseen data points.

New proof links initial class bias to DNN trainability, challenging traditional understanding.

problem Understanding the initial class bias in DNNs and its impact on trainability.
method Theoretical proof linking initial class bias to mean field theories of DNNs.
result Efficient learning is connected to a network's prejudice towards a specific class, contradicting traditional understanding.

Study minimax regret in sequential probability assignment with and without side information.

problem Minimax regret analysis in sequential probability assignment.
method Upper and lower bounds on minimax regret using square-root entropy.
result Lower bound matches upper bound for Donsker classes, up to log factors.

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…

2014-03-26abs ↗pdf ↗