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

Trend · papers per month

8.3%16.7%25.0%33.3% · Jan 199319922001200920172026
48 results for RESTful APIs

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 ↗

We introduce Microsoft Machine Learning for Apache Spark (MMLSpark), an ecosystem of enhancements that expand the Apache Spark distributed computing library to tackle problems in Deep Learning, Micro-Service Orchestration, Gradient Boosting, Model Interpretability, and other areas of modern computation. Furthermore, we…

2018-10-20abs ↗pdf ↗

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.

To save manual effort, developers often translate programs from one programming language to another, instead of implementing it from scratch. Translating application program interfaces (APIs) used in one language to functionally equivalent ones available in another language is an important aspect of program translation…

2019-06-10abs ↗pdf ↗

A new Python-C++ framework for agent-based simulation.

problem Understanding market dynamics and effects of delays.
method User-friendly Python API with efficient C++ implementation, message-driven architecture.
result Investigated the role of order processing delay in financial markets.

Paper identifies resting positions using EGG, ECG, respiration rate, and SpO2.

problem Identifying the resting position for health monitoring.
method Hybrid stacked ensemble machine learning model combining Decision tree, Random Forest, and Xgboost.
result 100% accurate prediction of resting positions.

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 ↗

InferPy is a Python package for probabilistic modeling with deep neural networks. It defines a user-friendly API that trades-off model complexity with ease of use, unlike other libraries whose focus is on dealing with very general probabilistic models at the cost of having a more complex API. In particular, this packag…

2019-08-29abs ↗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.

BrainSurfCNN predicts task contrasts from resting-state fingerprints, improving accuracy over baseline.

problem Predicting task-evoked activity from resting-state functional connectivity.
method Surface-based convolutional neural network (BrainSurfCNN) with reconstructive-contrastive loss.
result Significantly improved accuracy in predicting task contrasts over baseline.

REST improves robustness and efficiency of sleep monitoring models.

problem Noise and energy efficiency in deep learning models for home health monitoring.
method Adversarial training and spectral/sparsity regularization.
result REST models achieve 19x parameter reduction and 15x MFLOPS reduction with 17x energy reduction and 9x faster inference.

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.

The paper tackles rested bandits with non-decreasing and concave rewards, deriving lower bounds and an efficient algorithm.

problem Studying the sample complexity and optimal strategies for rested bandits with specific reward properties.
method Deriving regret lower bounds and designing an efficient algorithm R-ed-UCB with theoretical and empirical analysis.
result An efficient algorithm R-ed-UCB with a regret bound of O~(T23)\widetilde{\mathcal{O}}(T^{\frac{2}{3}}) under certain conditions.

Study on spin-zero rest-mass fields using conformal geometric method.

problem Wellposedness of Cauchy and Goursat problems for spin-n/2n/2 zero rest-mass equations.
method Conformal geometric method, energy equalities, partial conformal compactification.
result Proves wellposedness of Cauchy and Goursat problems and establishes field decays.

Graph-Triggered Bandits unify rested and restless bandits with graph-defined arm interactions.

problem Modeling sequential decision-making problems with evolving arm rewards.
method Graph-Triggered Bandits (GTBs) framework that generalizes rested and restless bandits using a graph.
result Rested and restless bandits are special cases of GTBs for suitable graphs.

FlexServe simplifies deployment of PyTorch models as REST endpoints.

problem Lack of control over model evolution and strict security requirements in operational environments.
method Developed FlexServe, a library to deploy multi-model ensembles with flexible batching.
result Rapid deployment of PyTorch models without intermediate transformations.

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.

Proposes SOVR loss to improve adversarial robustness by increasing logit margins.

problem Adversarial training's difficulty in robustness against sophisticated attacks.
method Introduces SOVR loss function that switches from cross-entropy to one-vs-the-rest loss for important samples.
result SOVR loss increases logit margins of important samples, improving robustness against Auto-Attack.

Training of one-vs.-rest SVMs can be parallelized over the number of classes in a straight forward way. Given enough computational resources, one-vs.-rest SVMs can thus be trained on data involving a large number of classes. The same cannot be stated, however, for the so-called all-in-one SVMs, which require solving a …

2016-11-25abs ↗pdf ↗