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

3468102136 · Jun 202019922001200920182026
48 results for online APIs

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.

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.

PyXAB is a Python library for X-armed bandits and online optimization.

problem Efficiently solving X-armed bandit problems and online blackbox optimization.
method Implementation of 10+ X-armed bandit algorithms and synthetic objectives.
result Evaluation of different algorithms' performance on various synthetic objectives.

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.

The paper explores how to learn from incomplete online social networks.

problem Learning from partially observed networks via node querying.
method Developed algorithms NOL* for sequential node querying to maximize network observability.
result It is possible to sequentially learn which nodes to query for maximal network observability.

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 ↗

Proposes RPG-RT for red-teaming T2I models without internal access.

problem Evaluating T2I models' security through red-teaming is challenging due to their closed-source nature and unknown defense mechanisms.
method Integrates LLM and rule-based preference modeling to dynamically adapt to unknown defense mechanisms.
result Demonstrates superior and practical approach for red-teaming T2I models.

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.

Proposes a new algorithm for efficient online model selection of LLMs considering the increasing-then-converging trend.

problem Balancing cost and performance in choosing the best LLM among a diverse set of models.
method Introduces a time-increasing bandit algorithm (TI-UCB) that predicts model performance increases and balances exploration and exploitation.
result Achieves a logarithmic regret upper bound, indicating a fast convergence rate in model selection.

Online trading platforms manipulate profits and losses, causing 82% of retail traders to lose money.

problem Manipulation of online trading platforms leading to financial losses for retail traders.
method Independent recording of trade details using REST API responses, comparison with broker reviews.
result 82% of retail traders lose money due to platform technical issues.

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.

Detects potential depegs in Curve's StableSwap pools to protect LPs.

problem Detecting and alerting LPs to potential depegs in Curve's StableSwap pools.
method Constructed metrics based on price and trading data, fine-tuned BOCD algorithm.
result Model detects USDC depeg 5 hours before price dip, with few false alarms.

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.

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.

CSA fills a gap in RLVR-trained LLM deployment by providing anytime-valid selective risk control.

problem Deployment of RLVR-trained LLMs in regulated organizations requires a safety certificate for every round without waiting for long-run averages.
method CSA uses a (test statistic, validity guarantee, deployment rule) framework to fill the gap, maintaining a Ville-type e-process per threshold on a Bonferroni grid.
result CSA provides the first anytime-valid selective risk control for RLVR-trained LLMs, matching the long-run average certification rate and satisfying pathwise validity and non-refusing deployment on every cell.