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

3.3%6.7%10.0%13.3% · May 201619922001200920172026
48 results for Stochastic Requests

Proposes proactive bed requests to reduce ED boarding and patient wait times.

problem Reduces ED boarding and patient wait times by proactively requesting inpatient beds.
method Formulates as a Markov decision process, uses predictions of admission probability and time to disposition to guide bed requests.
result Proactive aggregate bed requests can reduce boarding times by 30-70% and length of stay by 6-15%.

LLMs struggle to generate random numbers from statistical distributions, leading to biased results in applications.

problem LLMs' inability to generate random numbers accurately from specified distributions.
method Dual-protocol design: Batch Generation and Independent Requests, benchmarking 11 models across 15 distributions.
result Sampling fidelity degrades with distributional complexity and horizon, leading to systematic biases in downstream applications.

One of the major challenges in training deep architectures for predictive tasks is the scarcity and cost of labeled training data. Active Learning (AL) is one way of addressing this challenge. In stream-based AL, observations are continuously made available to the learner that have to decide whether to request a label …

2019-09-04abs ↗pdf ↗

Active learning is a type of sequential design for supervised machine learning, in which the learning algorithm sequentially requests the labels of selected instances from a large pool of unlabeled data points. The objective is to produce a classifier of relatively low risk, as measured under the 0-1 loss, ideally usin…

2012-07-16abs ↗pdf ↗

New method removes specific training data influence from neural networks.

problem Removing specific training data influence from neural networks for privacy and regulatory reasons.
method Noisy fine-tuning on retain data to ensure provable unlearning guarantees without restrictive assumptions.
result Achieves formal unlearning guarantees and performs effectively in practice.

Multiple machine learning and prediction models are often used for the same prediction or recommendation task. In our recent work, where we develop and deploy airline ancillary pricing models in an online setting, we found that among multiple pricing models developed, no one model clearly dominates other models for all…

2019-05-21abs ↗pdf ↗

In this paper we propose a novel framework for decentralized, online learning by many learners. At each moment of time, an instance characterized by a certain context may arrive to each learner; based on the context, the learner can select one of its own actions (which gives a reward and provides information) or reques…

2013-08-21abs ↗pdf ↗

Learning high-quality node embeddings is a key building block for machine learning models that operate on graph data, such as social networks and recommender systems. However, existing graph embedding techniques are unable to cope with fairness constraints, e.g., ensuring that the learned representations do not correla…

2019-05-25abs ↗pdf ↗

New algorithm reduces costs and latency for large language model inference.

problem Optimizing inference costs and latency for large language models with GPU constraints.
method Formulated as an online scheduling problem with endogenous memory growth, introduced fluid model and WAIT algorithms.
result Reduced costs and latency, especially in near-overloaded and overloaded regimes.

Automates U.S. visa petition document classification and RFE response generation.

problem Manual effort in organizing visa petition documents and responding to RFEs.
method Ensemble of image and text classifiers for document categorization and text classifier for RFE evidence identification.
result Achieves considerable accuracy in automated responses while reducing processing time.

This is the original paper appeared in the book "Elliptic and Parabolic Methods in Geometry (Minneapolis, MN,1994), A K Peters, Wellesley, MA, (1996)" (p.1-16), except with a few minor modifications as described at the end of the paper (on p.14). Due to frequent requests for the article, we decided to post it on the ar…

2012-03-21abs ↗pdf ↗

Deep RL improves power control and scheduling for wireless multicast systems.

problem Scalable power control and scheduling for wireless multicast networks.
method Deep reinforcement learning with function approximation using a deep neural network.
result Deep RL can learn optimal power control policies for large systems.

Bayesian inference forgetting framework removes influence of single data points.

problem Enforcement of the right to be forgotten in machine learning causes high costs for companies.
method Develops forgetting algorithms for variational and Markov chain Monte Carlo in Bayesian inference.
result Proves removal of influence of single datums on learned models with guaranteed generalizability.

Noisy labeled data is more a norm than a rarity for crowd sourced contents. It is effective to distill noise and infer correct labels through aggregation results from crowd workers. To ensure the time relevance and overcome slow responses of workers, online label aggregation is increasingly requested, calling for solut…

2018-07-19abs ↗pdf ↗

This is a set of expository lecture notes created originally for a graduate course on holomorphic curves taught at ETH Zurich and the Humboldt University Berlin in 2009/2010. The notes are still incomplete, but due to recent requests from readers, I've decided to make a presentable half-finished version available here.…

2010-11-07abs ↗pdf ↗

LATM framework uses LLMs to create and reuse tools for efficient problem-solving.

problem Improving problem-solving capabilities of LLMs with external tools.
method Closed-loop framework with two phases: tool making and tool using. LLMs act as both tool makers and users. Resource-intensive model for tool making, lightweight model for tool using.
result LATM framework achieves performance equivalent to using a powerful LLM for both roles but with significantly reduced costs.

The paper tackles a bandit problem with infinitely many arms per group, aiming to identify the group with the highest quantile reward.

problem Max-quantile group bandit problem with infinitely many arms per group.
method Two-step algorithm: first request arms from each group, then apply a finite-arm max-quantile bandit algorithm.
result Characterization of instance-dependent and worst-case regret, with matching lower bounds.

This paper circulated previously in a draft version. Now, upon general request, it is about time to distribute the more detailed (and much longer) version. The main technical issues revolve around the fine structure of the compactification of the moduli spaces of flow lines and the obstruction bundle technique, with re…

1996-06-14abs ↗pdf ↗

We study an asynchronous online learning setting with a network of agents. At each time step, some of the agents are activated, requested to make a prediction, and pay the corresponding loss. The loss function is then revealed to these agents and also to their neighbors in the network. Our results characterize how much…

2019-01-23abs ↗pdf ↗

In order to improve mobile data transparency, a number of network-based approaches have been proposed to inspect packets generated by mobile devices and detect personally identifiable information (PII), ad requests, or other activities. State-of-the-art approaches train classifiers based on features extracted from HTTP…

2019-07-30abs ↗pdf ↗