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

0.3%0.5%0.8%0.6% · Dec 201919922001200920182026
48 results for Callback API

Study detects illegal discrimination by employers using correspondence experiments.

problem Detecting illegal discrimination by individual employers based on protected characteristics.
method Correspondence experiments, bounding higher moments of causal effects, decision rules for investigation.
result 85% of jobs contacting both white and black applicants are likely to discriminate.

This paper investigates how machine learning APIs change over time and proposes an efficient method to monitor these changes.

problem Understanding and assessing changes in machine learning APIs over time.
method Systematic investigation of ML API shifts, proposing a principled adaptive sampling algorithm (MASA) for efficient estimation of confusion matrix shifts.
result MASA can accurately estimate confusion matrix shifts using up to 90% fewer samples compared to random sampling.

Generative GAN improves classifier performance with limited training data.

problem Limited training data for black-box API attacks.
method Generative adversarial network (GAN) to generate synthetic training data.
result Improves classifier performance with synthetic data.

Paper studies deep learning attacks on online APIs with limited data.

problem Adversarial machine learning threats on online APIs with strict rate limitations.
method Develops an active learning approach to build adversarial classifiers with limited training data.
result Active learning can build adversarial classifiers with small statistical difference from target classifiers using limited data.

Paper proposes OpenAPI to interpret PLM models without access to parameters.

problem Interpreting hidden predictive models without access to parameters.
method Closed-form solution using overdetermined linear equation systems.
result Exact and consistent interpretations for PLM models.

I present a web service for querying an embedding of entities in the Wikidata knowledge graph. The embedding is trained on the Wikidata dump using Gensim's Word2Vec implementation and a simple graph walk. A REST API is implemented. Together with the Wikidata API the web service exposes a multilingual resource for over …

2017-10-11abs ↗pdf ↗

CK simplifies ML model deployment and reproducibility with open APIs and DevOps.

problem Making ML models reproducible and deployable across different environments.
method Decompose complex systems into reusable sub-components with unified APIs and DevOps principles.
result Automatically co-design and optimize ML models for speed, accuracy, energy, and size.

Open-source Vizier optimizes complex systems for Google and beyond.

problem Optimizing large-scale systems with multiple objectives and constraints.
method Distributed, fault-tolerant, flexible API for blackbox optimization.
result OSS Vizier supports a wide range of optimization problems and is available as open-source.

We consider the infinite-horizon discounted optimal control problem formalized by Markov Decision Processes. We focus on several approximate variations of the Policy Iteration algorithm: Approximate Policy Iteration, Conservative Policy Iteration (CPI), a natural adaptation of the Policy Search by Dynamic Programming a…

2014-05-12abs ↗pdf ↗

PettingZoo library accelerates multi-agent reinforcement learning research.

problem Challenges in multi-agent reinforcement learning, especially conceptual models of games.
method Developed PettingZoo library with AEC games model to address multi-agent reinforcement learning challenges.
result AEC games model addresses conceptual issues in multi-agent reinforcement learning environments.

Paper explores how non-neural simulators can enhance DP synthetic data generation.

problem Generating differentially private synthetic data without access to foundation models.
method Private Evolution (PE) framework using inference APIs and simulators.
result Sim-PE framework improves downstream classification accuracy and FID scores.

Deep learning models misclassify malware with added benign features.

problem Detecting malware with deep learning when it's mixed with benign code.
method Trained a deep neural network classifier using benign and malware features. Demonstrated the impact of adding benign features to malware. Used data augmentation to improve classifier robustness.
result Adding benign features to malware significantly increases false negatives.

KL-constrained API shows optimization issues and improved with regularization.

problem Optimization issues in KL-constrained API algorithms.
method Comparison of KL divergence as a constraint vs. regularizer, empirical evaluation.
result KL-constrained API is not guaranteed to converge and incurs linear regret.

Paper develops a framework to test deep RL traffic controllers under various uncertainties.

problem Developing robust deep RL traffic controllers for dynamic urban areas.
method Open-source callback-based framework for evaluating deep RL configurations in a traffic simulation.
result Deep RL controllers perform well under demand surges, incidents, and sensor failures.

GANs visualize malware behavior for proactive protection.

problem Malware authors' advantage in testing and augmenting malicious code.
method GAN trained on distributed image representation of malware behaviors.
result Generated synthetic malware for adversarial training of anti-malware models.

Transformer models improve malware classification, especially for imbalanced datasets.

problem Imbalanced multiclass malware classification.
method Bagging-based random transformer forest (RTF) ensemble of pre-trained transformer models (BERT or CANINE).
result Ensemble of pre-trained transformer models achieves state-of-the-art F1-score of 0.6149 on a benchmark dataset.

In this paper, we propose a novel policy iteration method, called dynamic policy programming (DPP), to estimate the optimal policy in the infinite-horizon Markov decision processes. We prove the finite-iteration and asymptotic l\infty-norm performance-loss bounds for DPP in the presence of approximation/estimation erro…

2010-04-12abs ↗pdf ↗

Recently, a novel class of Approximate Policy Iteration (API) algorithms have demonstrated impressive practical performance (e.g., ExIt from [2], AlphaGo-Zero from [27]). This new family of algorithms maintains, and alternately optimizes, two policies: a fast, reactive policy (e.g., a deep neural network) deployed at t…

2018-05-28abs ↗pdf ↗

Denoised smoothing defends pretrained classifiers against adversarial attacks.

problem Adversarial attacks on pretrained classifiers.
method Prepending a denoiser to any off-the-shelf classifier using randomized smoothing.
result Guaranteed p\ell_p-robustness to adversarial examples without modifying the pretrained classifier.

Efficiently distills white-box adversarial attacks into black-box models.

problem Generating efficient adversarial examples for robustness.
method Train a model to emulate white-box attack behavior and distill it into a more efficient black-box model.
result Reduces adversarial example generation time by 19x-39x and transfers to black-box settings.

Optimizes leveraged staking strategies in decentralized finance.

problem Maximizing returns on staked assets in decentralized lending platforms.
method Developed a mathematical framework to optimize leveraged staking strategies, reducing the multi-market problem to convex allocation over market exposures.
result Rebalanced leveraged positions can achieve up to 6.2% APY, significantly higher than unleveraged staking.