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

Trend · papers per month

7132026 · Jun 202019922001200920172026
48 results for Protections

Develops methods to measure and reduce fairness in datasets with limited protected attribute labels.

problem Measuring and reducing fairness in datasets with limited protected attribute labels.
method Proposes methods to estimate fairness metrics and train models to limit fairness violations using probabilistic protected attribute labels.
result Our methods provide tighter bounds on true disparity and effectively reduce fairness violations with lesser fairness-accuracy trade-offs.

Study protects federated learning models from eavesdropping attacks.

problem Protecting client models in federated learning from eavesdropping adversaries.
method Theoretical analysis and numerical experiments examining various factors.
result Theoretical and experimental results show the effectiveness of protection methods.

Fairness audits fail under missing protected labels, especially at zero access.

problem Understanding the reliability of fairness audits with incomplete protected-label data.
method Introduced a seed-calibrated stress test to separate missingness effects from seed-to-seed movement.
result Missing protected labels do not significantly alter fairness mitigation methods, but they can lead to harmful intersectional outcomes.

The paper analyzes how to combine self-protection and self-insurance for risk reduction.

problem Combining self-protection and self-insurance for risk reduction when market insurance is absent.
method The approach uses Value-at-Risk and Tail Value-at-Risk to evaluate residual risk and solves the problem using isoquant geometry based on marginal-balance curves.
result The analysis identifies the conditions under which self-protection and self-insurance behave as substitutes or complements.

Researchers create topologically protected knots in a realizable system.

problem Creating topologically protected vortex knots in experimentally realizable systems.
method Investigated non-Abelian vortices in tetrahedral order in spin-2 Bose--Einstein condensates and bent-core nematic liquid crystals.
result Discovered the first topologically protected knots in an experimentally realizable system.

The paper proposes methods to infer from privacy-protected data using simulation-based techniques.

problem Valid statistical inference from privacy-protected data is computationally challenging.
method Simulation-based inference methods, including sequential Monte Carlo and neural conditional density estimators.
result Valid statistical inferences can be made from privacy-protected data.

Framework for fair classification with noisy protected attributes and provable guarantees.

problem Fair classification with noisy protected attributes.
method Optimization framework for linear and linear-fractional fairness constraints, handling multiple non-binary attributes.
result Provably fair classifier with minimal accuracy loss, even with large noise.

Fair clustering under the disparate impact doctrine requires that population of each protected group should be approximately equal in every cluster. Previous work investigated a difficult-to-scale pre-processing step for kk-center and kk-median style algorithms for the special case of this problem when the number of …

2019-01-29abs ↗pdf ↗

A multi-task network avoids indirect discrimination in insurance pricing.

problem Indirect discrimination in insurance pricing models based on protected characteristics.
method Multi-task neural network architecture trained with partial protected characteristic information.
result Multi-task network produces discrimination-free insurance prices with comparable accuracy to conventional models.

Protects user privacy in models using optional personal data.

problem Ensuring fairness for users who opt-out of data sharing.
method Formalizes protection requirements, introduces Protected User Consent (PUC), devises data augmentation strategy.
result PUC-compliant models can improve performance without disadvantaging opt-out users.

ARL improves fairness without protected features, showing AUC improvements for worst-case groups.

problem Training fairness in ML without known protected features.
method Adversarially Reweighted Learning (ARL) using non-protected features and task labels.
result ARL improves Rawlsian Max-Min fairness with notable AUC improvements for worst-case groups.

Proposes a new method for fairness in machine learning with multiple protected attributes.

problem Ensuring fairness in machine learning models with continuous and multiple protected attributes.
method Distance covariance regularisation framework to mitigate association between model predictions and protected attributes.
result Demonstrates effectiveness in mitigating fairness gerrymandering in regression tasks.

New algorithm mitigates bias in subset selection with noisy protected attributes.

problem Mitigating bias in subset selection when protected attributes are noisy.
method Formulated a denoised selection problem and developed a linear-programming based approximation algorithm.
result The approach can produce fairer subsets despite noisy protected attributes.

Topologically protected vortex knots and links are proposed and proven.

problem Decaying of tangled vortex structures through local reconnections and strand crossings.
method Proposed and proven topologically protected vortex structures using non-Abelian topological vortices.
result Existence of topologically protected Q8Q_8-colored links and classification using the QQ-invariant.

Many existing fairness criteria for machine learning involve equalizing some metric across protected groups such as race or gender. However, practitioners trying to audit or enforce such group-based criteria can easily face the problem of noisy or biased protected group information. First, we study the consequences of …

2020-02-21abs ↗pdf ↗

New EPS insurance offers partial protection against superannuation losses.

problem Lack of efficient investment insurance for superannuation holders.
method Developed a new financial derivative, equity protection swap (EPS), and derived a fair pricing formula.
result EPS can be an efficient investment insurance tool for superannuation accounts.

Fairness has become a central issue for our research community as classification algorithms are adopted in societally critical domains such as recidivism prediction and loan approval. In this work, we consider the potential bias based on protected attributes (e.g., race and gender), and tackle this problem by learning …

2019-04-30abs ↗pdf ↗

Invariants for colored links found, with topological protection of certain knots.

problem Finding invariants for colored links and understanding their topological stability.
method Equivariant bordism groups of Conner and Floyd, topological surgeries.
result Topological protection of certain tricolored knots, with specific transformations.

Proposes a general deep neural network method for digital watermarking.

problem Protecting intellectual content in a massive, IoT-acquired image dataset.
method Train a neural network on an image set and use it to protect distinct test images in bulk.
result Demonstrates the robustness and practicality of the proposed method.

New fairness criterion for risk-sensitive decisions in regulated industries.

problem Ensuring equitable outcomes in risk-sensitive decision-making.
method Marginal fairness for generalized distortion risk measures, two-step decision-making process.
result Ensures fairness in decision-making under risk measures, regardless of protected attributes.

Study shows how price protection affects online learning algorithms for dynamic pricing.

problem Impact of price protection guarantee on online learning algorithms for dynamic pricing.
method Characterized the effect of price protection period length on optimal regret, proposed LEAP algorithm.
result Optimal regret is Θ(√T + min{M, T^2/3}) with LEAP matching lower bounds up to logarithmic factors.

Paper presents a dynamic tail risk protection strategy using ML and econometrics.

problem Tail risk protection in finance with solid mathematical and statistical tools.
method Dynamic tail risk protection strategy using weak classifiers (parametric and non-parametric) to estimate exceedance probability and derive trading signals.
result Ensemble classifier improves generalization and trading performance.

PASS protects private attributes by stochastically substituting data.

problem Protecting private attributes in ML services while maintaining data utility.
method PASS uses stochastic data substitution with a novel loss function derived from information theory.
result PASS effectively protects private attributes across various datasets.

Investors target specific regions of payoff distributions for portfolio optimization.

problem Optimizing portfolio performance across different return distribution regions.
method Developed a dynamic portfolio-choice framework targeting downside or upside quantiles.
result Policies focused on downside regions provide stronger left-tail protection and higher Sharpe ratios.

SLIP secures LLMs on edge devices by splitting computation and protecting sensitive parts.

problem Protecting LLMs on edge devices from theft and unauthorized use.
method SLIP uses matrix decomposition to split model computation between secure and vulnerable resources, ensuring zero accuracy degradation and minimal latency.
result SLIP is the first practical, secure hybrid protocol for protecting LLMs on edge devices.

In this paper, we consider a dynamic asset pricing model in an approximate fractional economy to address empirical regularities related to both investor protection and past information. Our newly developed model features not only in terms with a controlling shareholder who diverts a fraction of the output, but also goo…

2019-11-01abs ↗pdf ↗

Vanilla CNNs, as uncalibrated classifiers, suffer from classifying out-of-distribution (OOD) samples nearly as confidently as in-distribution samples. To tackle this challenge, some recent works have demonstrated the gains of leveraging available OOD sets for training end-to-end calibrated CNNs. However, a critical que…

2019-10-18abs ↗pdf ↗

The paper examines how risk reduction and insurance choices interact under convex premium principles.

problem Interaction between self-protection and insurance demand under convex premium principles.
method Investigates optimal prevention efforts and insurance shares using distortion risk measures.
result Self-protection and insurance are complementary, but ex ante moral hazard can turn this into a substitution effect.

This paper optimizes power grid protection settings to maximize network degradation due to cascading attacks.

problem Cascading attacks on power grids and their undetected nature.
method Constrained Bayesian Optimization applied to transmission line protection settings.
result Even limited misconfiguration of protection settings can cause severe cascading attacks.

CST detects discrimination by comparing protected and non-protected individuals with a counterfactual.

problem Detecting discrimination in classifiers using legal fairness conditions.
method Operationalizes fairness given the difference using counterfactual reasoning.
result CST uncovers more discrimination cases than traditional situation testing.

New framework for fair classification in adversarial settings with provable guarantees.

problem Fairness in classification with adversarial perturbations of protected attributes.
method Optimization framework for learning fair classifiers with provable guarantees.
result Near-tightness of accuracy and fairness guarantees for multiple protected attributes and various hypothesis classes.

Link prediction (LP) algorithms propose to each node a ranked list of nodes that are currently non-neighbors, as the most likely candidates for future linkage. Owing to increasing concerns about privacy, users (nodes) may prefer to keep some of their connections protected or private. Motivated by this observation, our …

2019-07-20abs ↗pdf ↗

The paper tackles fairness in estimating graphical models, especially for protected attributes.

problem Fairness issues in estimating graphical models, particularly for sensitive characteristics.
method Integrates pairwise graph disparity error and a tailored loss function into a multi-objective optimization problem.
result Successfully mitigates bias in graphical model estimation without compromising model performance.

Quantile regression is a tool for learning conditional distributions. In this paper we study quantile regression in the setting where a protected attribute is unavailable when fitting the model. This can lead to "unfair'' quantile estimators for which the effective quantiles are very different for the subpopulations de…

2019-07-19abs ↗pdf ↗