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.

169,051 papers · 148 categories

Trend · papers per month

1223 · Jul 201919922001200920172026
48 results for permissions

Deep learning models misclassify malware with added benign features.

problem Detecting malware with deep learning when it's mixed with benign code.
method Trained a deep neural network classifier using benign and malware features. Demonstrated the impact of adding benign features to malware. Used data augmentation to improve classifier robustness.
result Adding benign features to malware significantly increases false negatives.

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 ↗

Proposes a test to ensure predictive algorithms predict intended outcomes better than unintended ones.

problem Unintended model behavior leading to prediction of unintended outcomes.
method Falsification framework using nonparametric hypothesis testing to compare prediction losses across outcomes.
result Establishes discriminant validity with respect to gender but not race in an admissions setting.

Given a polyhedral surface, assume that it is prohibited to change the shape and size of any face but it is permissible to change the dihedral angles between the faces. A polyhedral surface is said to be flexible if it is possible to change its shape under the above restrictions. We prove that flexible polyhedral surfa…

2001-11-01abs ↗pdf ↗

For a certain class of distributions, we prove that the linear programming relaxation of kk-medoids clustering---a variant of kk-means clustering where means are replaced by exemplars from within the dataset---distinguishes points drawn from nonoverlapping balls with high probability once the number of points drawn a…

2013-09-12abs ↗pdf ↗

This paper was first written in 1990, but was never published. In it, the author presents a novel approach to the study of constant curvature spacetimes in 2+1 dimensions. A parameterization of flat 2+1-dimensional domains of dependence is given in terms of measured geodesic laminations. There is also an interesting re…

2007-06-11abs ↗pdf ↗

Private statistics estimation faces a bias, accuracy, and privacy trilemma.

problem Balancing privacy, accuracy, and bias in statistical estimation.
method Use differential privacy (DP) for private statistics, but clip samples to control sensitivity and add noise for privacy, introducing bias.
result No algorithm can simultaneously have low bias, low error, and low privacy loss for arbitrary distributions.

We present POLO --- a C++ library for large-scale parallel optimization research that emphasizes ease-of-use, flexibility and efficiency in algorithm design. It uses multiple inheritance and template programming to decompose algorithms into essential policies and facilitate code reuse. With its clear separation between…

2018-10-08abs ↗pdf ↗

Develops a minimax optimal estimator for system stability under distribution shift.

problem Ensuring system reliability under changes in the underlying environment.
method Minimax optimal estimation of stability defined in terms of acceptable performance degradation.
result Characterizes the minimax convergence rate and demonstrates practical utility.

This paper tackles efficient data deletion from machine learning models.

problem Efficiently removing individual data points from trained machine learning models.
method Investigates algorithmic principles for data deletion and proposes efficient deletion algorithms for k-means clustering.
result Proposes two provably efficient deletion algorithms for k-means clustering that achieve significant improvement in deletion efficiency.

This study provides a new mathematical structure for Koopman eigenfunctions.

problem Understanding and representing nonlinear dynamics as linear.
method Theoretical, analytical, and numerical approaches to Koopman eigenfunction space.
result Equivalence of minimal generating set and maximal independent set, defining conditions for independence.

This thesis examines the accuracy of scaling VaR estimates for longer holding periods.

problem The accuracy of VaR estimates for longer holding periods using the square root of time rule.
method Examined VaR scaling for longer holding periods using empirical analysis.
result Scaling can provide good estimates of VaR but may lead to significant losses over time.

New estimator improves policy evaluation in resource allocation RCTs.

problem Difficulty in evaluating policies optimizing limited resource allocation through RCTs.
method Proposes a novel estimator involving retrospective reshuffling of participants across experimental arms.
result The new estimator provides more accurate policy evaluations than common methods.

Machine-learning models have been recently used for detecting malicious Android applications, reporting impressive performances on benchmark datasets, even when trained only on features statically extracted from the application, such as system calls and permissions. However, recent findings have highlighted the fragili…

2018-03-09abs ↗pdf ↗

Pattern recognition and machine learning are becoming integral parts of algorithms in a wide range of applications. Different algorithms and approaches for machine learning include different tradeoffs between performance and computation, so during algorithm development it is often necessary to explore a variety of diff…

2014-06-21abs ↗pdf ↗

New credit attribution methods for machine learning models using relaxed stability guarantees.

problem Ensuring proper attribution in generative models trained on existing works.
method Proposed new definitions of stability that allow for non-stable processing of a subset of datapoints with permission.
result Extended well-studied stability notions and provided a comprehensive characterization of learnability.

Private mean estimation with multiple samples requires a certain number of people to maintain privacy.

problem Private mean estimation with person-level differential privacy for multiple samples.
method The approach involves estimating the mean up to a distance α in ℓ_2-norm under ε-differential privacy, using algorithms based on the clip-and-noise framework and new analyses.
result The necessary and sufficient number of people to estimate the mean up to distance α in ℓ_2-norm is given by a specific formula.

Paper shows spectral filters can transfer between different graphs discretizing the same space.

problem Transferability of spectral filters between different graphs.
method Analysis of spectral filters on graphs discretizing the same space.
result Spectral filters have similar effects on graphs discretizing the same space.

Gradient-based explanations correlate with Android malware classifier robustness.

problem Evasion attacks on Android malware classifiers using sparse perturbations.
method Investigated gradient-based attribution methods for explaining classifier decisions and their evenness, proposing metrics to assess adversarial robustness.
result Gradient-based explanations, especially Integrated Gradients, correlate with adversarial robustness of malware classifiers.

Proposes a flexible framework for implied volatility surfaces with random parameters.

problem Inconsistent calibration of parametric implied volatility models when market volatility deviates from the model's regime.
method Introduces random coefficients for parametric implied volatility formulas, preserving analytic flexibility and efficiency.
result Demonstrates improved modeling of implied volatility curves, especially for short-term options and earnings announcements.

In a recent paper, it is shown that the LASSO algorithm exhibits "near-ideal behavior," in the following sense: Suppose y=Az+ηy = Az + η where AA satisfies the restricted isometry property (RIP) with a sufficiently small constant, and η2ε\Vert η\Vert_2 \leq ε. Then minimizing z1\Vert z \Vert_1 subject to $\Vert y - Az \Ver…

2014-01-26abs ↗pdf ↗

COF algorithm minimizes cost in multi-armed bandits with known costs and reward constraints.

problem Minimizing cost while meeting a minimum reward requirement in uncertain environments.
method COF algorithm that intelligently combines samples from all arms to gauge feasibility and minimize cost.
result COF achieves instance-dependent upper bounds on cumulative cost and quality regret.

The goal of this book is to characterize algebraically the closed 4-manifolds that fibre nontrivially or admit geometries in the sense of Thurston, or which are obtained by surgery on 2-knots, and to provide a reference for the topology of such manifolds and knots. The first chapter is purely algebraic. The rest of the…

2002-12-10abs ↗pdf ↗