New algorithm shows how networked agents can protect against systemic risk.
problem Understanding and managing systemic risk in networked systems.
method Developed a simple algorithm to model protection dynamics in networked agents.
result Protection mechanisms can emerge even in random networks, reducing systemic risk.
Study differential privacy in multi-agent RL, achieving efficient and private learning.
problem Protecting sensitive data in multi-agent reinforcement learning.
method Extending DP definitions to two-player games, designing an efficient algorithm with privatized bonuses.
result Achieved trajectory-wise differential privacy in multi-agent RL, improving regret bounds.
Locally private reinforcement learning protects individual environments from reverse engineering.
problem Protecting private information in distributed reinforcement learning environments.
method Locally differentially private algorithms that protect local agents' models from adversarial reverse engineering.
result Demonstrated that the proposed algorithm performs well under local differential privacy (LDP).
In this paper, the agent-based modeling is employed to model the effect of intellectual property policy at the speed of technological advancement. Every agent has inborn preferences towards investing their capital into independent technological development, innovation appropriation, and production. The relative cost of…
This paper combines RL with CPPI and TIPP for better trading strategies.
problem Challenges in quantitative trading due to swift dynamics and uncertainties.
method Fusion of CPPI and TIPP with MADDPG framework for multi-agent reinforcement learning.
result CPPI-MADDPG and TIPP-MADDPG outperform traditional strategies in real-market shares.
RS-DQN protects RL agents from adversarial attacks.
problem Adversarial attacks can disrupt deep RL training and evaluation.
method Online robustness training with RS-DQN combining state-of-the-art adversarial and provably robust training.
result RS-DQN makes RL agents resilient to strong attacks.
In this work we essentially reinterpreted the Sieczka-Hołyst (SH) model to make it more suited for description of real markets. For instance, this reinterpretation made it possible to consider agents as crafty. These agents encourage their neighbors to buy some stocks if agents have an opportunity to sell these stocks.…
P2B improves local agent performance with differential privacy.
problem Improving local agent performance with differential privacy.
method Differential privacy technique to collect and update local agents' feedback.
result Competitive performance on synthetic and real-world data.
Proportional centroid clustering aims to fairly group points without prior protected subsets.
problem Fairly group points without prior protected subsets.
method Define fairness as proportionality, present algorithms for efficient computation and optimization.
result Proportional solutions trade off with the k-means objective.
A risk-aware RL approach using RDEU and Wasserstein ball for robust performance.
problem Optimizing risk-aware performance criteria in uncertain environments.
method Rank dependent expected utility (RDEU) for risk assessment, Wasserstein ball for robustness, actor/agent framework.
result Explicit policy gradient formulae for robust optimization.
Paper presents a privacy-preserving algorithm for estimating peer effects using the Ising model.
problem Privacy concerns in estimating peer effects using network data.
method Developed a (ε,δ)-differentially private algorithm using Ising model. result Established regret bounds and validated performance on synthetic and real-world networks.
Study uses RL to hedge financial derivatives, showing robust strategies outperform non-robust ones.
problem Risk mitigation and gain-seeking in hedging path-dependent financial derivatives.
method Robust risk-aware reinforcement learning (RL) with policy gradient approach.
result Robust hedging strategies outperform non-robust ones under varying data generating processes.
Incentive-aware recommender system for online platforms.
problem Myopic agents exploit optimal arms, not exploring alternatives.
method Model as multi-agent bandit problem, incentivizes exploration.
result Asymptotically optimal performance with ex-post fairness.
FRD protects privacy in distributed RL by sharing proxy experience memory.
problem Privacy violation in exchanging experience memory in distributed RL.
method Proposes FRD framework using proxy experience memory.
result Numerical evaluation shows FRD is effective and performance depends on proxy memory structure.
Gray-box attack improves on white-box methods for trading agents.
problem Robustness of Deep RL trading agents against adversarial attacks.
method Hybrid Deep Neural Network policy for gray-box adversarial attack.
result Adversary can reduce trading agent's reward by 214.17%.
BlockFLow ensures privacy and accountability in federated learning.
problem Malicious agents can weaken federated learning models.
method Differential privacy, auditing mechanism, Ethereum smart contracts.
result Audit scores reflect the quality of honest agents' datasets.
Paper tackles end-to-end training of complex neural networks using DIP method.
problem Training complex heterogeneous neural network models end-to-end.
method Deep Innovation Protection (DIP) method using multiobjective optimization.
result End-to-end training of complex heterogeneous neural network models is possible.
Paper proposes protecting DNN models with secret key preprocessing.
problem Protecting deep learning models from unauthorized access.
method Block-wise pixel shuffling with secret key for preprocessing.
result Protected models maintain close performance to non-protected models with correct key, but accuracy drops significantly with incorrect key.
DEOT method compares distributions across agents with privacy and efficiency.
problem Comparing distributions across agents in a distributed system.
method Decentralized entropic optimal transport with mini-batch randomized block-coordinate descent and decentralized kernel approximation.
result The method provides a privacy-preserving and communication-efficient solution to distributed distribution comparison.
This work improves privacy in federated combinatorial bandits by balancing regret and privacy.
problem Privacy-preserving learning in competitive online learning settings with quality constraints.
method Proposes P-FCB algorithm for federated combinatorial bandits, balancing regret and privacy.
result Improves regret while maintaining quality constraints and privacy guarantees.
Deep RL team defends payloads from obstacles.
problem Protecting high-value payloads from obstacles during navigation.
method Multi-agent deep reinforcement learning for coordinated escort teams.
result Escort teams increase navigation success by up to 75%.
FedConPE improves conversational recommender systems efficiency and privacy.
problem Efficiently eliciting user preferences in interactive systems with heterogeneous clients.
method Phase elimination-based federated conversational bandit algorithm with adaptive key term construction.
result Minimizes uncertainty across all dimensions in feature space and offers improved efficiency and privacy.
Paper proposes a new approach to GDPR compliance using data protection analytics.
problem Lack of research on data protection risk management and difficulty in GDPR compliance.
method Quantitative approach to data protection risk-based compliance.
result Improves data protection impact assessments by integrating analytics and expert opinions.
The study examines how backrun auctions can protect traders from price manipulation.
problem Price manipulation by arbitrageurs in batched trading venues.
method Developed a laminated queueing model to study price manipulation and introduced a price manipulation coefficient.
result Bound the price manipulation coefficient and found it approximated by a 'zeta value' with measurable parameters.
Framework uses LLMs to automate strategy finding in quantitative finance.
problem Brittleness of traditional deep learning models in financial applications.
method Three-stage framework with prompt-engineered LLMs, multimodal agent-based evaluation, and dynamic weight optimization.
result Robust performance in Chinese & US markets, superior risk-adjusted performance.
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.
Privacy-preserving inference for clinical trials using differential privacy.
problem Balancing knowledge sharing and privacy in healthcare data.
method Differential privacy (DP) applied to log-linear belief updates in distributed settings.
result Differentially private, distributed inference methods outperform existing techniques.
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 rise of connected personal devices together with privacy concerns call for machine learning algorithms capable of leveraging the data of a large number of agents to learn personalized models under strong privacy requirements. In this paper, we introduce an efficient algorithm to address the above problem in a fully…
New methods ensure fairness in noisy protected groups.
problem Noisy or biased protected group information complicates fairness audits.
method Robust optimization techniques to enforce fairness on true groups.
result Robust approaches achieve better true group fairness guarantees.
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.
A new memory replay mechanism improves reinforcement learning stability and speed.
problem Forgetting in reinforcement learning with continuous control.
method Augmented Memory Replay (AMR) that optimizes the replay of past experiences.
result AMR enhances stability and convergence speed of learning algorithms.
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 k-center and k-median style algorithms for the special case of this problem when the number of …
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.
Study removes bias from chest X-ray embeddings using orthogonalization.
problem Reduces bias in chest X-ray embeddings due to protected features.
method Orthogonalization technique to remove protected feature effects.
result Orthogonalization removes bias and makes predictions of protected attributes infeasible.
A new federated learning framework with sparsification and adaptive optimization for privacy and efficiency.
problem Lack of sufficient privacy protection in federated learning.
method Integrates random sparsification with gradient perturbation and acceleration techniques to enhance privacy and efficiency.
result Outperforms previous differentially-private federated learning approaches in privacy and efficiency.
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.
The study examines how investor protection and past information affect stock returns and interest rates.
problem Empirical regularities related to investor protection and past information in asset pricing models.
method Developed a dynamic asset pricing model with a controlling shareholder and good/bad memory in budget dynamics.
result Good/bad memory of investors on historical market information affects stock returns and interest rates, strengthening investor protection in high ownership concentration.
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.
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.
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.
Adds layers to NNs to protect them from reverse engineering.
problem Extracting the underlying model of a Neural Network.
method Introducing parasitic layers that approximate a noisy identity mapping with a Convolutional NN.
result The protected NN's predictions remain mostly unchanged while making reverse-engineering more complex.
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.
DPLP predicts links while protecting some node-pairs' privacy.
problem Link prediction with protected connections in private networks.
method DPLP uses differential privacy on graphs to protect node-pairs, applying a monotone transform and noise to base scores.
result DPLP effectively balances privacy and link prediction accuracy.