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

Trend · papers per month

count % of corpus

8 results for “Attribute-Efficient”

Attribute-Efficient Learning of Halfspaces with Malicious Noise: Near-Optimal Label Complexity and Noise Tolerancestat.ML

Efficiently learns halfspaces with malicious noise, near-optimal label complexity.

problem Learning

s

-sparse halfspaces under malicious label noise.

method Active learning algorithm with instance reweighting and empirical risk minimization.

result Near-optimal label complexity of

O(s \log^4 d / ε)

and noise tolerance

Ω(ε)

Learning Halfspaces Malicious Noise Attribute-Efficient Active Learning

2020-06-06abs ↗pdf ↗

Attribute-Efficient PAC Learning of Low-Degree Polynomial Threshold Functions with Nasty Noisecs.DS

New algorithm learns PTFs with noisy data efficiently.

problem Learning low-degree PTFs with noisy data efficiently.

method Structural result and novel robust Chow vector estimation.

result PAC learns PTFs with nasty noise using efficient samples.

PAC learning Polynomial threshold functions Attribute sparsity Nasty noise Chow vector

2023-06-01abs ↗pdf ↗

Efficient active learning of sparse halfspacescs.LG

We study the problem of efficient PAC active learning of homogeneous linear classifiers (halfspaces) in $\mathbb{R}^d$ , where the goal is to learn a halfspace with low error using as few label queries as possible. Under the extra assumption that there is a $t$ -sparse halfspace that performs well on the data ( $t \ll d$ )…

2018-05-07abs ↗pdf ↗

Probabilistic Shapley Value Modeling and Inferencecs.LG

PSI models and infers feature attributions efficiently and accurately.

problem Modeling and inferring feature attributions in flexible predictive models.

method Probabilistic Shapley inference (PSI) framework using latent random variables and a masking-based neural network architecture.

result PSI learns feature attribution distributions centered at Shapley values, revealing meaningful uncertainty.

Shapley value feature attribution probabilistic inference flexible models variational objective

2024-02-06abs ↗pdf ↗

Data Shapley in One Training Runcs.LG

In-Run Data Shapley offers efficient data attribution for large-scale models.

problem Existing data attribution methods are computationally intensive and cannot target specific models.

method In-Run Data Shapley, which efficiently attributes data contributions to a specific model without re-training.

result In-Run Data Shapley achieves significant efficiency, enabling data attribution for pretraining models.

Data Shapley Machine Learning Data Attribution Efficiency Generative AI

2024-06-16abs ↗pdf ↗

Attribute Efficient Linear Regression with Data-Dependent Samplingcs.LG

In this paper we analyze a budgeted learning setting, in which the learner can only choose and observe a small subset of the attributes of each training example. We develop efficient algorithms for ridge and lasso linear regression, which utilize the geometry of the data by a novel data-dependent sampling scheme. When …

2014-10-23abs ↗pdf ↗

Social and Physical Attributes-Defined Trust Evaluation for Effective Collaborator Selection in Human-Device Coexistence Systemscs.HC

A method for trust evaluation of devices in human-device coexistence systems.

problem Efficient trust evaluation of devices in systems with diverse physical and social attributes.

method Canonical correlation analysis-enhanced hypergraph self-supervised learning (HSLCCA).

result The proposed HSLCCA method significantly outperforms baseline algorithms in identifying trusted devices.

trust evaluation human-device coexistence hypergraph canonical correlation analysis self-supervised learning

2025-10-01abs ↗pdf ↗

On the Power of Localized Perceptron for Label-Optimal Learning of Halfspaces with Adversarial Noisecs.LG

New algorithm learns halfspaces with adversarial noise efficiently.

problem Learning halfspaces in the presence of adversarial noise.

method Polynomial-time Perceptron-like online active learning algorithm.

result Near-optimal label and sample complexity with isotropic log-concave marginal distribution.

Perceptron Online Learning Adversarial Noise Halfspace Learning Label Complexity

2020-12-19abs ↗pdf ↗