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

Trend · papers per month

3527041,0561,408 · Jun 202019922001200920172026
48 results for Model Security

Securely trains regression models with secret sharing for data collaboration.

problem Balancing data collaboration for technological improvements with security concerns.
method Secret sharing scheme for scalable and efficient secure multiparty training.
result Scalable and efficient protocols for training linear and logistic regression models.

Study assesses how much security restaking protocols need to pay for.

problem Determining the optimal security level for restaking protocols using token incentives.
method Expanding a model by Durvasula and Roughgarden to include strategic attackers and node operators, constructing an approximation algorithm for token-based incentives.
result Restaking protocols can be secure with proper incentive management, even against strategic adversaries.

The paper analyzes security issues in blockchain ecosystems with multiple SSPs and proposes two models for better stake management.

problem Security issues in blockchain ecosystems with multiple SSPs and stake fragmentation.
method Formalized the Multiple SSP Problem and analyzed two architectures: Model M\mathbb{M} and Model S\mathbb{S} through convex optimization and game-theoretic lens.
result Model S\mathbb{S} achieves tighter security guarantees through single validator sets and aggregated slashing logic.

Secure XGB for privacy-preserving machine learning in federated learning.

problem Privacy-preserving machine learning in federated learning with practical gradient tree boosting models.
method Secure multi-party computation, distributed model storage, secure permutation protocols.
result Our XGB models provide competitive accuracy and practical performance.

Explores security challenges of machine learning in real-world systems.

problem Vulnerabilities in machine learning models deployed in safety-critical systems.
method Broadens systems security view of ML vulnerabilities, identifies novel challenges, proposes mitigation suggestions.
result Highlights novel challenges and proposes mitigation strategies for securing ML systems.

Sparse oblique decision tree improves security rules for renewable power systems.

problem Identifying secure operating conditions in power systems with high renewable energy.
method Sparse weighted oblique decision tree to learn and embed linear security rules.
result The method significantly increases secure states and reduces solution time.

The study calculates securities lending haircuts and indemnification costs.

problem Managing borrower default risk in securities markets.
method Repo haircut model applied to securities lending transactions; quantifies haircuts and indemnification costs.
result Computed borrower-dependent haircuts and indemnification costs for US Treasuries and equities.

Secure federated learning framework resists adversarial users.

problem Resilience against adversarial (Byzantine) users in federated learning.
method Integrated stochastic quantization, verifiable outlier detection, and secure model aggregation.
result First single-server Byzantine-resilient secure aggregation framework (BREA) for secure federated learning.

We propose a new randomized ensemble technique with a provable security guarantee against black-box transfer attacks. Our proof constructs a new security problem for random binary classifiers which is easier to empirically verify and a reduction from the security of this new model to the security of the ensemble classi…

2019-06-07abs ↗pdf ↗

Paper revisits PCA for anomaly detection in network security.

problem Understanding and improving anomaly detection in network security.
method Revisit probabilistic PCA model and its connection to MSNM framework.
result Mathematical model connects PCA to MSNM for anomaly detection.

Optimizes a portfolio for an investor preferring accepted securities over a reference security.

problem Investor preference for a set of securities over a reference security with constraints.
method Mean-variance optimization with Sharpe Ratio performance measurement.
result Derives an optimal portfolio that maximizes returns while minimizing risk.

Unified market-based description of returns and variances of trades.

problem Market-based variance of trades and market portfolio.
method Unified market-based approach to describe returns and variances of trades and market portfolio.
result Market-based variance accounts for random volumes of trades and differs from Markowitz's portfolio variance.

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.

We develop a secure aggregation protocol for federated learning that reduces communication and computation costs.

problem Expensive communication and privacy concerns in federated learning.
method Adapting compression-based federated techniques to additive secret sharing.
result Our protocol achieves high accuracy with low communication costs and is more efficient than prior work.

FastSecAgg improves federated learning security and efficiency.

problem Privacy leakage in federated learning due to model parameter sharing.
method Introduces FastSecAgg, a secure aggregation protocol with FFT-based multi-secret sharing (FastShare).
result Efficient in computation and communication, robust to client dropouts.

This research secures deployed sentiment analysis models by identifying and defending against attack vectors.

problem Securing deployed machine learning models, particularly sentiment analysis systems, from adversarial attacks.
method BAD (Build, Attack, Defend) Architecture, evaluating two implementations.
result Demonstrated a viable methodology for securing machine learning models in production.

Contextual bandit framework improves revenue optimization in securities lending market.

problem Optimizing revenue for agent lenders in a dynamic securities lending market.
method Utilized contextual bandit frameworks to address dynamic pricing problems in an e-commerce-like securities lending market.
result Contextual bandit approach consistently outperforms traditional methods by at least 15% in total revenue generated.

Market-based portfolio variance measures risks using trade data.

problem Measuring portfolio risks using traditional methods ignores trade volume randomness.
method Uses time series of trades with securities and portfolio to assess variance.
result Portfolio variance can be decomposed into securities' contributions, accounting for trade volume randomness.

We say that a pair of points x and y is secure if there exist a finite set of blocking points such that any geodesic between x and y passes through one of the blocking points. The main point of this paper is to exhibit new examples of blocking phenomena both in the manifold and the billiard table setting. As an approac…

2007-07-03abs ↗pdf ↗

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.

The article presents a new entropy model for assessing stock market interest.

problem Assessing investor interest and market sentiment in exchange-traded securities.
method Intrinsic entropy model using actual trading data, without exogenous factors.
result Empirical evidence supports the model's ability to predict trading activity.

This research highlights the secrecy potential of nonlinear generative models and their all-or-nothing phase transition.

problem Secrecy potential of nonlinear generative models in statistical learning.
method Replica method to derive asymptotic normalized cross entropy and statistical decoupling of Bayesian estimator.
result Strictly nonlinear models exhibit an all-or-nothing phase transition, leading to perfect secrecy.

As neural networks revolutionize many applications, significant privacy conflicts between model users and providers emerge. The cryptography community developed a variety of techniques for secure computation to address such privacy issues. As generic techniques for secure computation are typically prohibitively ineffec…

2019-11-27abs ↗pdf ↗

Secure Aggregation protocols allow a collection of mutually distrust parties, each holding a private value, to collaboratively compute the sum of those values without revealing the values themselves. We consider training a deep neural network in the Federated Learning model, using distributed stochastic gradient descen…

2016-11-14abs ↗pdf ↗

A riemannian manifold is secure if the geodesics between any pair of points in the manifold can be blocked by a finite number of point obstacles. Compact, flat manifolds are secure. A standing conjecture says that these are the only secure, compact riemannian manifolds. The conjecture claims, in particular, that a riem…

2008-06-22abs ↗pdf ↗

Paper develops security model and pricing for stable digital currency in quantum blockchain network.

problem Securing and pricing stable digital currency in a quantum blockchain network.
method Developed a block-based quantum channel networking technology and a FinTech platform model with dynamic pricing.
result Established a generalized IoB security model using quantum channel networking and QKD.

Broker uses multi-task dynamic pricing to learn competitive prices in credit markets.

problem Lack of data and infrequent trading in credit markets.
method Two-Stage Multi-Task (TSMT) algorithm that leverages shared structure across securities.
result TSMT algorithm achieves a regret bound of O(TMd+Md)O(\sqrt{T M d} + M d), outperforming baselines.

Markowitz simplified portfolio returns assuming constant trade volumes.

problem Understanding portfolio returns and variance in markets with variable trade volumes.
method Investor observes market trades, models portfolio as single security, derives portfolio return and variance.
result Markowitz's equation for portfolio returns and variance is a simplified approximation of real markets with constant trade volumes.

A system for federated learning with private data, adding discrete Gaussian noise and secure aggregation.

problem Training models on private data distributed across devices while ensuring privacy.
method Discretizes data, adds discrete Gaussian noise, and uses secure aggregation to protect privacy.
result Matches the accuracy of central differential privacy with less than 16 bits of precision per value.

Secure aggregation for buffered asynchronous federated learning without TEEs.

problem Privacy and convergence in buffered asynchronous federated learning.
method Developed a new protocol (BASecAgg) that ensures privacy without TEEs by carefully designing masks.
result BASecAgg achieves similar convergence guarantees as FedBuff without TEEs.

To promote secure and private artificial intelligence (SPAI), we review studies on the model security and data privacy of DNNs. Model security allows system to behave as intended without being affected by malicious external influences that can compromise its integrity and efficiency. Security attacks can be divided bas…

2018-07-31abs ↗pdf ↗