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

Trend · papers per month

4896143191 · Jun 202019922001200920172026
48 results for hiding strategy

A game theory study on optimal hiding and searching strategies in discrete locations.

problem Optimal hiding and searching strategies in a two-person zero-sum game between a hider and a searcher.
method Proved the existence of optimal strategies, developed an algorithm to compute them, and compared with a simple strategy.
result Optimal hiding strategy involves hiding in each location with nonzero probability, and optimal searching strategy can be constructed with up to n simple sequences.

Through multi-agent competition, the simple objective of hide-and-seek, and standard reinforcement learning algorithms at scale, we find that agents create a self-supervised autocurriculum inducing multiple distinct rounds of emergent strategy, many of which require sophisticated tool use and coordination. We find clea…

2019-09-17abs ↗pdf ↗

Learning to cooperate with friends and compete with foes is a key component of multi-agent reinforcement learning. Typically to do so, one requires access to either a model of or interaction with the other agent(s). Here we show how to learn effective strategies for cooperation and competition in an asymmetric informat…

2018-08-06abs ↗pdf ↗

Optimizes trading in CFMMs and exchanges using deep learning.

problem Optimizing trading strategies in CFMMs and exchanges.
method Develops a model accounting for interaction between CFMMs and exchanges, employs deep Galerkin method to solve dynamic programming equation.
result Optimal strategy outperforms naïve strategies and is not prone to price slippage.

AutoDIME automates design of multi-agent environments for RL.

problem Designing multi-agent environments for reinforcement learning is challenging.
method Developed intrinsic teacher rewards for multi-agent settings and evaluated them in various tasks.
result Value disagreement was found to be most consistent and effective across tasks.

Image steganography is a procedure for hiding messages inside pictures. While other techniques such as cryptography aim to prevent adversaries from reading the secret message, steganography aims to hide the presence of the message itself. In this paper, we propose a novel technique for hiding arbitrary binary data in i…

2019-01-12abs ↗pdf ↗

Matryoshka hides secret models in a carrier model, achieving high capacity and robustness.

problem Stealing functionality of private ML data by hiding models in a carrier model.
method Parameter sharing approach exploiting the learning capacity of the carrier model.
result Hides a 26x larger secret model or 8 secret models in the carrier model.

Paper shows how to hide individuals in graphs to fool community detection models.

problem Adversarial attack on community detection models by hiding individuals.
method Iterative learning framework that updates a graph generator and a community detection model.
result Adversarial graphs generated by the method can fool multiple community detection models.

Steganography is the science of hiding a secret message within an ordinary public message, which is referred to as Carrier. Traditionally, digital signal processing techniques, such as least significant bit encoding, were used for hiding messages. In this paper, we explore the use of deep neural networks as steganograp…

2019-02-07abs ↗pdf ↗

The paper shows examples of 2-complexes that can't be embedded in R^4, hiding obstructions in higher Milnor invariants.

problem Embedding 2-complexes in R^4 with hidden obstructions.
method Provides examples of 2-complexes and families of PL immersions that hide embedding obstructions.
result Embedding obstructions vanish for the given examples, answering a question in Avramidi-Okun-Schreve's paper.

Researchers found PP-GANs can hide sensitive data in sanitized images, undermining privacy checks.

problem Lack of formal proofs of privacy in PP-GANs for image sanitization.
method Subverted PP-GANs for facial expression recognition to hide sensitive data in sanitized images.
result It is possible to hide sensitive identification data in sanitized PP-GAN output images, even allowing reconstruction of entire input images.

HiDe learns hierarchical control for complex tasks by separating planning and control.

problem Solving long horizon control tasks with generalization to unseen scenarios.
method Functional decomposition of state-action spaces, RL-based planner, modular transfer of policy layers.
result Generalizes across unseen test environments and scales to longer horizons.

We consider a fundamental dynamic allocation problem motivated by the problem of securities lending\textit{securities lending} in financial markets, the mechanism underlying the short selling of stocks. A lender would like to distribute a finite number of identical copies of some scarce resource to nn clients, each of whom has a priv…

2019-12-12abs ↗pdf ↗

A novel approach to federated learning with strong privacy guarantees.

problem Maintaining privacy of clients' data and federator's objective in federated learning.
method Inspired by knowledge distillation and private information retrieval, the approach combines secret-sharing-based multi-party computation and graph-based private information retrieval.
result Strong information-theoretic privacy guarantees for federated learning.

We propose an approach to fair classification that enforces independence between the classifier outputs and sensitive information by minimizing Wasserstein-1 distances. The approach has desirable theoretical properties and is robust to specific choices of the threshold used to obtain class predictions from model output…

2019-07-28abs ↗pdf ↗

TIPRDC anonymizes data features to protect privacy while retaining useful information.

problem Privacy concerns from crowdsourced data hinder deep learning applications.
method Hybrid training method combining adversarial and mutual information estimation.
result Feature extractor hides private information while preserving original data features.

CycleGAN (Zhu et al. 2017) is one recent successful approach to learn a transformation between two image distributions. In a series of experiments, we demonstrate an intriguing property of the model: CycleGAN learns to "hide" information about a source image into the images it generates in a nearly imperceptible, high-…

2017-12-08abs ↗pdf ↗

Missing data imputation can help improve the performance of prediction models in situations where missing data hide useful information. This paper compares methods for imputing missing categorical data for supervised classification tasks. We experiment on two machine learning benchmark datasets with missing categorical…

2016-10-28abs ↗pdf ↗

The thesis tackles two stochastic control problems in capital structure and portfolio choice.

problem Optimizing banks' dividend and recapitalization policies and individual's life-cycle portfolio choice.
method Developed stochastic control models to calibrate and analyze U.S. banks' asset values and optimal portfolio selection models.
result Calibrated model reveals that noise in reported asset values can hide up to one-third of true asset return volatility and increase banks' market equity value by 7.8%.

Convolutional neural networks have been used to achieve a string of successes during recent years, but their lack of interpretability remains a serious issue. Adversarial examples are designed to deliberately fool neural networks into making any desired incorrect classification, potentially with very high certainty. Se…

2019-02-25abs ↗pdf ↗

Study minimax optimal RL in factored MDPs with bonus exploration.

problem Optimal reinforcement learning in episodic factored MDPs.
method Proposes two model-based algorithms with bonus exploration for minimax optimal regret.
result Achieves minimax optimal regret guarantees for rich factored structures.

Glare is a phenomenon that occurs when the scene has a reflection of a light source or has one in it. This luminescence can hide useful information from the image, making text recognition virtually impossible. In this paper, we propose an approach to detect glare in images taken by users via mobile devices. Our method …

2019-10-24abs ↗pdf ↗

Most accurate recommender systems are black-box models, hiding the reasoning behind their recommendations. Yet explanations have been shown to increase the user's trust in the system in addition to providing other benefits such as scrutability, meaning the ability to verify the validity of recommendations. This gap bet…

2016-06-22abs ↗pdf ↗

Improved analysis for nonconvex SGD methods with flexible sampling.

problem Finding approximately stationary points of nonconvex functions with gradient evaluations.
method Generalized SPIDER and PAGE algorithms with flexible sampling mechanisms.
result Sharper complexity bounds for optimal SGD methods in smooth nonconvex settings.

Christoffel function characterizes the corruption a bounded-degree certificate cannot remove in robust halfspace learning.

problem Robust halfspace learning under malicious noise
method Sum-of-Squares degree of outlier-removal certificate
result Christoffel function bounds the corruption a bounded-degree certificate cannot remove

We present heuristics for solving the maximin problem induced by the generative adversarial privacy setting for linear and convolutional neural network (CNN) adversaries. In the linear adversary setting, we present a greedy algorithm for approximating the optimal solution for the privatizer, which performs better as th…

2018-10-04abs ↗pdf ↗

This work presents the foundations of Singular Semi-Riemannian Geometry and Singular General Relativity, based on the author's research. An extension of differential geometry and of Einstein's equation to singularities is reported. Singularities of the form studied here allow a smooth extension of the Einstein field eq…

2013-01-10abs ↗pdf ↗

Given a model ff that predicts a target yy from a vector of input features x=x1,x2,,xM\pmb{x} = x_1, x_2, \ldots, x_M, we seek to measure the importance of each feature with respect to the model's ability to make a good prediction. To this end, we consider how (on average) some measure of goodness or badness of prediction (wh…

2019-10-01abs ↗pdf ↗

Framework certifies fairness of machine learning models interactively and privately.

problem Certifying fairness of machine learning models in privacy-preserving scenarios.
method Interactive test with cryptographic techniques for fairness certification.
result Empirical evaluation of fairness for various models and definitions.

Time reversal invariance can be summarized as follows: no difference can be measured if a sequence of events is run forward or backward in time. Because price time series are dominated by a randomness that hides possible structures and orders, the existence of time reversal invariance requires care to be investigated. …

2007-08-29abs ↗pdf ↗

Federated learning is a recent advance in privacy protection. In this context, a trusted curator aggregates parameters optimized in decentralized fashion by multiple clients. The resulting model is then distributed back to all clients, ultimately converging to a joint representative model without explicitly having to s…

2017-12-20abs ↗pdf ↗