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

11233445 · Jun 202019922001200920182026
48 results for third party interference

New approach to reinforcement learning that balances safety and performance against adversaries.

problem Balancing safety and performance in reinforcement learning against potential adversaries.
method Developed a new reinforcement learning framework that integrates interruptibility, resilience, and safe exploration.
result Achieved both interruptibility and resilience to adversaries without sacrificing optimal policy probability.

Secure neural network inference on untrusted platforms using holographic reduced representations.

problem Secure neural network inference on untrusted platforms.
method Connectionist Symbolic Pseudo Secrets using Holographic Reduced Representations (HRR).
result Empirical robustness to attack under various threat models.

We lay theoretical foundations for new database release mechanisms that allow third-parties to construct consistent estimators of population statistics, while ensuring that the privacy of each individual contributing to the database is protected. The proposed framework rests on two main ideas. First, releasing (an esti…

2017-10-04abs ↗pdf ↗

We show how to restructure the counterparty risk faced by the originator of a securitization or covered bond arising from an interest rate hedging swap assisted by a "one-way" collateral agreement. This risk emerges when the swap is negotiated between the special purpose vehicle and a third party that covers itself thr…

2013-10-26abs ↗pdf ↗

Unlike other industries in which intellectual property is patentable, the financial industry relies on trade secrecy to protect its business processes and methods, which can obscure critical financial risk exposures from regulators and the public. We develop methods for sharing and aggregating such risk exposures that …

2011-11-19abs ↗pdf ↗

We study the problem of portfolio insurance from the point of view of a fund manager, who guarantees to the investor that the portfolio value at maturity will be above a fixed threshold. If, at maturity, the portfolio value is below the guaranteed level, a third party will refund the investor up to the guarantee. In ex…

2011-02-22abs ↗pdf ↗

DADI framework dynamically discovers fair information using reinforcement learning.

problem Discovering fair information from third-party features with unknown objectives.
method Adversarial reinforcement learning agent that balances accuracy and fairness.
result Achieves group fairness by rewarding the agent with the adversary's loss.

A distributed framework protects privacy while maintaining fairness in machine learning.

problem Protecting personal demographic data while ensuring fair machine learning outcomes.
method A distributed framework with private third-party data communication, ensuring privacy and fairness.
result Four fair learning methods consistently outperform existing ones in fairness and accuracy across three real-world datasets.

In this paper, we advocate for representation learning as the key to mitigating unfair prediction outcomes downstream. Motivated by a scenario where learned representations are used by third parties with unknown objectives, we propose and explore adversarial representation learning as a natural method of ensuring those…

2018-02-17abs ↗pdf ↗

Lapse-supported life insurance exacerbates adverse selection risks.

problem Lapse-supported life insurance increases adverse selection costs.
method Modeling 'Term to 100' contracts and analyzing three methods of managing lapse surplus.
result Adverse selection losses can be almost unlimited under certain conditions.

This paper optimizes SMPC for neural network inference, reducing memory and time.

problem Memory and time constraints in secure neural network inference.
method Implemented ABY2.0 protocol, optimized memory usage, and used a helper node.
result MNIST inference reduced from 8.03 GB RAM and 200s to 0.2 GB RAM and 32s.

Asynchronous federated learning for vertically partitioned data improves efficiency and privacy.

problem Efficiently train models on vertically partitioned data without a trusted third party.
method Proposed AFSGD-VP and its SVRG and SAGA variants for asynchronous federated learning.
result AFSGD-VP and its variants achieve higher efficiency than synchronous algorithms.

A digital euro protocol offers complete privacy and offline transactions using Groth-Sahai proofs.

problem Fragile digital payment solutions with privacy and offline transaction issues.
method Design and implementation of a Central Bank Digital Currency (CBDC) using Groth-Sahai zero-knowledge proofs.
result Complete privacy and offline transaction capability with retroactive double-spending detection.

New measure of interference helps understand and mitigate learning issues in reinforcement learning.

problem Understanding and mitigating interference in reinforcement learning.
method Defined a new measure of interference, evaluated it, and identified key factors contributing to interference.
result Target network frequency and updates on the last layer are significant factors in interference.

A DL autoencoder tackles interference channels, improving SNR and INR.

problem Improving performance in interference channels with varying interference levels.
method Designing a DL neural network autoencoder for a k-user Gaussian interference channel, classifying interferences as weak to very strong.
result DL autoencoder significantly mitigates interference effects, especially with known α and low offset.

Evidence acquisition costs influence disclosure behavior and preference.

problem How evidence acquisition costs affect disclosure behavior and preference.
method Analyzes sender-receiver interactions with covert and overt evidence acquisition, varying certification costs.
result Equilibria converge to the Pareto-worst free-learning equilibrium as costs vanish, and receivers prefer covert to overt acquisition.

New method removes interference bias in causal models.

problem Interference bias impedes causal effect identification in real-world settings.
method Novel definition of causal models with local interference, semi-parametric assumptions.
result True Average Causal Effect can be identified in certain semi-parametric models with local interference.

Study finds reinforcement learning performance plateaus due to environmental interference.

problem Catastrophic interference hinders sample efficiency in reinforcement learning.
method Empirical study in ALE, controlled experiments, analysis of prediction errors.
result Interference causes performance plateaus and degrades policies used to reach them.

Estimates causal effects in networks with varying interference.

problem Estimating causal effects in settings with network interference.
method Proposes neighborhood adaptive estimators for average direct treatment effect on the treated.
result Establishes rates of convergence and distributional results for proposed estimators.

TD learning reduces interference, leading to better generalization.

problem Understanding and reducing interference in TD learning for better generalization.
method Analyzing the inner product of gradients as interference, comparing TD and supervised learning, and examining the dynamics of interference and bootstrapping.
result TD learning leads to low-interference, under-generalizing parameters, while supervised learning does the opposite.

The paper addresses Qini curve estimation under clustered network interference.

problem Qini curves can be biased when interference is ignored in clustered network settings.
method Proposes three estimation strategies for clustered network interference.
result Identifies the most appropriate approach based on bias-variance trade-offs.

This work addresses causal inference challenges in networked interference and proposes GNN-based estimators for individual treatment effects.

problem Estimating individual treatment effects in randomized experiments with networked interference.
method Uses Graph Neural Networks (GNNs) to capture network dependencies and derive causal effect estimators.
result Provides policy regret bounds and heuristic error bounds for GNN-based causal estimators under network interference and treatment capacity constraints.

Multi-party machine learning leaks global dataset properties even with black-box access.

problem Leakage of global dataset properties in multi-party machine learning.
method Demonstrated leakage of sensitive attribute distributions in pooled data.
result A curious party can infer sensitive attribute distributions in other parties' data with high accuracy.

Study efficient inference for network quantile causal effects with partial interference.

problem Estimating network causal effects on outcome quantiles with partial interference.
method Developed a nonparametric efficiency theory and a nonparametrically efficient estimator using a three-way cross-fitting procedure.
result Proposed estimator is consistent, asymptotically normal, and allows flexible estimation of nuisance functions.

Combines two graph models to handle interference effects in Gaussian distributions.

problem Handling interference effects in causal models for Gaussian distributions.
method Integrates Lauritzen-Wermuth-Frydenberg and Andersson-Madigan-Perlman chain graphs.
result Proposes a new class of causal models that can represent interference and non-interference relationships.

Spatial Deconfounder tackles interference and confounding in spatial data.

problem Interference and unmeasured spatial factors confound causal inference in spatial domains.
method Two-stage method using CVAE with spatial prior to reconstruct confounder, then estimate causal effects.
result Nonparametric identification of direct and spillover effects under weak assumptions.

Algorithm learns interference network and optimizes treatment allocation for unknown network effects.

problem Adaptive experimentation under unknown network interference.
method Thompson sampling algorithm with Gibbs sampler for joint learning of interference network and treatment allocation.
result Proves a Bayesian regret bound and achieves sublinear regret in real-world applications.

Federated Learning prioritizes client data contributions for better model quality.

problem Privacy concerns and reluctance to share private data in machine learning.
method Prioritizes client data contributions in Federated Learning by assigning scores based on defined criteria.
result The proposed approach yields a higher quality global model compared to standard Federated Learning.

In [1] Zawadoski introduces a banking network model in which the asset and counter-party risks are treated separately and the banks hedge their assets risks by appropriate OTC contracts. In his model, each bank has only two counter-party neighbors, a bank fails due to the counter-party risk only if at least one of its …

2014-02-21abs ↗pdf ↗

Bayesian method estimates causal effects with proxy networks.

problem Estimating causal effects with only proxy measurements of a latent interference network.
method Structural causal model with Block Gibbs sampler and Locally Informed Proposals.
result Accurately estimates causal effects even with noisy proxy networks.

SecureGBM securely trains GBM models across two parties without revealing data.

problem Securely training GBM models across parties with encrypted data.
method Extending LightGBM with semi-homomorphic encryption and stochastic approximation.
result SecureGBM achieves AUC within 3% of non-secure LightGBM, maintaining performance.

FRONT optimizes decisions with interference, reducing regret over time.

problem Short-sighted policies in online decision-making due to ignoring interference.
method FRONT considers long-term impacts of decisions, using exploratory and exploitative strategies.
result FRONT achieves sublinear regret in both immediate and consequential impacts.

The paper tackles adaptive targeting in networks with interference effects.

problem Adaptive targeting under network interference in a bandit setting.
method Linear model in a sparse regime, analyzing different levels of knowledge of the interference structure.
result Unified view of how knowledge of the interference structure affects online learning efficiency.

Machine learning reduces wind tunnel testing costs for tall buildings.

problem Limited wind tunnel tests fail to fully reveal interference effects of tall buildings.
method Used machine learning techniques, including GANs, to predict pressure coefficients.
result GANs model based on 30% of dataset accurately predicts pressure coefficients under unseen conditions.