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

Trend · papers per month

3774110147 · Jun 202019922001200920172026
48 results for Online Services

The online environment has provided a great opportunity for insurance policyholders to share their complaints with respect to different services. These complaints can reveal valuable information for insurance companies who seek to improve their services; however, analyzing a huge number of online complaints is a compli…

2018-06-26abs ↗pdf ↗

Recently, the online car-hailing service, Didi, has emerged as a leader in the sharing economy. Used by passengers and drivers extensive, it becomes increasingly important for the car-hailing service providers to minimize the waiting time of passengers and optimize the vehicle utilization, thus to improve the overall u…

2018-04-06abs ↗pdf ↗

Two methods estimate effect size for online experiments, improving accuracy and efficiency.

problem Determining the correct effect size for online experiment duration.
method Two approaches: hierarchical models and utility theory.
result Proposed methods outperform baseline approaches in accuracy and efficiency.

Detecting faults and SLA violations in a timely manner is critical for telecom providers, in order to avoid loss in business, revenue and reputation. At the same time predicting SLA violations for user services in telecom environments is difficult, due to time-varying user demands and infrastructure load conditions. In…

2015-09-04abs ↗pdf ↗

User churn is an important issue in online services that threatens the health and profitability of services. Most of the previous works on churn prediction convert the problem into a binary classification task where the users are labeled as churned and non-churned. More recently, some works have tried to convert the us…

2019-09-15abs ↗pdf ↗

Online reviews have become a vital source of information in purchasing a service (product). Opinion spammers manipulate reviews, affecting the overall perception of the service. A key challenge in detecting opinion spam is obtaining ground truth. Though there exists a large set of reviews online, only a few of them hav…

2019-03-19abs ↗pdf ↗

Study on electronic banking satisfaction in Nigeria.

problem Limited research on factors enhancing end users' satisfaction in electronic banking.
method Empirical analysis of factors influencing electronic banking user satisfaction.
result Factors influencing electronic banking user satisfaction and their relationship with satisfaction.

We propose an efficient distributed online learning protocol for low-latency real-time services. It extends a previously presented protocol to kernelized online learners that represent their models by a support vector expansion. While such learners often achieve higher predictive performance than their linear counterpa…

2019-11-28abs ↗pdf ↗

This work analyzes how users and services adapt to reduce risk, leading to specialization.

problem Adaptation of users and services to reduce risk affects learning and performance.
method Analyzed a class of dynamics where users allocate participation and services update parameters.
result Repeated myopic updates with multiple learners lead to better outcomes than repeated risk minimization.

Large companies need to monitor various metrics (for example, Page Views and Revenue) of their applications and services in real time. At Microsoft, we develop a time-series anomaly detection service which helps customers to monitor the time-series continuously and alert for potential incidents on time. In this paper, …

2019-06-10abs ↗pdf ↗

Reinforcement learning improves online matching by combining expert policies.

problem Efficient decision-making in complex systems like cloud services and marketplaces.
method Combines reinforcement learning with expert policies, using advantage-based weight updates.
result The orchestrated policy converges faster and yields higher efficiency than individual experts and conventional RL.

Efficient sequential matching of supply and demand is a problem of interest in many online to offline services. For instance, Uber, Lyft, Grab for matching taxis to customers; Ubereats, Deliveroo, FoodPanda etc for matching restaurants to customers. In these online to offline service problems, individuals who are respo…

2018-03-27abs ↗pdf ↗

New method uses correlated auxiliary feedback to reduce regret in parameterized bandits.

problem Reducing regret in parameterized bandits with correlated auxiliary feedback.
method Develops a reward estimator using auxiliary feedback with tight confidence bounds.
result Shows significant reduction in regret compared to standard methods.

In an online contract selection problem there is a seller which offers a set of contracts to sequentially arriving buyers whose types are drawn from an unknown distribution. If there exists a profitable contract for the buyer in the offered set, i.e., a contract with payoff higher than the payoff of not accepting any c…

2013-05-15abs ↗pdf ↗

In many online applications interactions between a user and a web-service are organized in a sequential way, e.g., user browsing an e-commerce website. In this setting, recommendation system acts throughout user navigation by showing items. Previous works have addressed this recommendation setup through the task of pre…

2018-09-07abs ↗pdf ↗

This paper uses bandit algorithms to reduce the cost of user interface experimentation in online retail.

problem Reducing the cost of user interface experimentation in online retail.
method Modeling user interface experimentation as an opportunistic bandit problem, reducing the cost of exploration.
result Significant regret reduction and improved contextual information for testing.

Interactive user interfaces need to continuously evolve based on the interactions that a user has (or does not have) with the system. This may require constant exploration of various options that the system may have for the user and obtaining signals of user preferences on those. However, such an exploration, especiall…

2018-12-01abs ↗pdf ↗

Paper proposes an online anomaly detection method for real-time systems.

problem Rare events endanger profitability, safety, and environmental aspects.
method Online inverse cumulative distribution-based approach with dynamic process limits.
result Eliminates common problems of offline anomaly detectors and provides low-latency detection.

Automated data-driven decision-making systems are ubiquitous across a wide spread of online as well as offline services. These systems, depend on sophisticated learning algorithms and available data, to optimize the service function for decision support assistance. However, there is a growing concern about the accounta…

2019-07-16abs ↗pdf ↗

Algorithmic decision making systems are ubiquitous across a wide variety of online as well as offline services. These systems rely on complex learning methods and vast amounts of data to optimize the service functionality, satisfaction of the end user and profitability. However, there is a growing concern that these au…

2015-07-19abs ↗pdf ↗

Dynamic assortment problem on two-sided platform with unknown parameters

problem Optimizing assortment display in an online platform with incomplete information and heterogeneous customers
method Data-driven algorithm that learns choice parameters while optimizing revenue
result Worst-case regret grows polylogarithmically over time

Machine learning (ML) models may be deemed confidential due to their sensitive training data, commercial value, or use in security applications. Increasingly often, confidential ML models are being deployed with publicly accessible query interfaces. ML-as-a-service ("predictive analytics") systems are an example: Some …

2016-09-09abs ↗pdf ↗

SOOTT framework optimizes target tracking with robust and learning-augmented algorithms.

problem Optimizing target tracking in dynamic environments with adversarial perturbations.
method Integrates robust and learning-augmented algorithms for online decision-making.
result CoRT learning-augmented algorithm strictly improves over robust BEST when predictions are accurate.

Optimal hidden-target learning for online inventory optimization on general convex sets.

problem Online inventory optimization (OIO) on arbitrary bounded convex capacity sets.
method Maintaining a hidden target and projecting it onto the feasible order-up-to set.
result The method improves the best known regret guarantee for OIO on general convex sets from inverse to inverse-square-root dependence on the common-demand probability.

SPARKLE handles high-dimensional covariates for online decision-making.

problem Complex reward-covariate relationships in high-dimensional settings.
method SPARKLE uses a sparse additive reward model with doubly penalized estimator and adaptive screening.
result SPARKLE achieves sublinear regret bound logarithmic in covariate dimensionality.

Automated service classification plays a crucial role in service discovery, selection, and composition. Machine learning has been widely used for service classification in recent years. However, the performance of conventional machine learning methods highly depends on the quality of manual feature engineering. In this…

2018-06-14abs ↗pdf ↗

OTT services are replacing traditional telecom services, affecting revenue streams.

problem OTT services are reducing traditional telecom revenue streams.
method Quantitative analysis of mobile user trends and revenue changes.
result OTT services are becoming more prevalent and impacting telecom revenue.

Optimal vehicle repositioning policy found for shared mobility services.

problem Matching fixed supply with spatial customer demand under uncertain and correlated demand.
method Base-stock repositioning policy, asymptotic optimality, regret analysis, adaptive repositioning algorithm.
result Surrogate Optimization and Adaptive Repositioning algorithm achieves optimal regret of O(n2.5T)O(n^{2.5} \sqrt{T}).

To accommodate heterogeneous tasks in Internet of Things (IoT), a new communication and computing paradigm termed mobile edge computing emerges that extends computing services from the cloud to edge, but at the same time exposes new challenges on security. The present paper studies online security-aware edge computing …

2018-05-09abs ↗pdf ↗

A new ride-hailing subsidy system uses deep causal networks to estimate consumer elasticity.

problem Estimating consumer elasticity with subsidies in ride-hailing industry.
method Introduces a consumer subsidizing system using deep causal networks to address confounding effects.
result Effective in estimating the uplift effect of subsidies without confounding.