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

2468 · Jun 202619922001200920172026
48 results for silent abandonment

Silent abandonment reduces contact center efficiency by 5%-15%.

problem Measuring customer abandonment and patience in text-based contact centers is challenging due to uncertainty.
method Developed methodologies to identify silent-abandonment customers and estimate customer patience using text analysis and queueing models.
result Silent abandonment accounts for 30%-67% of customer abandonments and reduces system efficiency by 5%-15%.

Neural networks can learn kernel machines with a data-dependent kernel.

problem Can neural networks in the rich feature learning regime learn a kernel machine?
method Demonstrated silent alignment effect in neural networks, showing they can learn a kernel machine with a data-dependent kernel.
result Neural networks in the rich feature learning regime can learn a kernel machine with a data-dependent kernel due to silent alignment.

This paper maps the insurability of AI risks across various insurance products.

problem Emerging AI risks and their implications for insurance coverage.
method Coding 55 AI threat classes against 26 insurance products using public carrier materials and threat catalogs.
result Identification of a four-tier insurability frontier: affirmatively insured, silent-AI exposures, actively excluded, and unstructured perils.

Lipreading has a lot of potential applications such as in the domain of surveillance and video conferencing. Despite this, most of the work in building lipreading systems has been limited to classifying silent videos into classes representing text phrases. However, there are multiple problems associated with making lip…

2019-06-28abs ↗pdf ↗

The wave trace of certain convex domains can be smooth near some points in the length spectrum.

problem Understanding the relationship between the wave trace and the length spectrum of convex domains.
method Constructing silent periodic billiard orbits with the same length but different Maslov indices, using a microlocal parametrix for wave invariants.
result The wave trace can be smooth near some points in the length spectrum, showing potential limitations for inverse spectral problems.

New algorithm estimates eigenspace with faulty nodes, matching performance of existing methods.

problem Estimating eigenspace in distributed systems with node failures.
method Develops an eigenspace estimation algorithm for distributed environments with arbitrary node failures.
result Matches performance of existing non-robust estimator up to an additive error.

Consider a platform that wants to learn a personalized policy for each user, but the platform faces the risk of a user abandoning the platform if she is dissatisfied with the actions of the platform. For example, a platform is interested in personalizing the number of newsletters it sends, but faces the risk that the u…

2018-02-23abs ↗pdf ↗

In this paper we consider an online recommendation setting, where a platform recommends a sequence of items to its users at every time period. The users respond by selecting one of the items recommended or abandon the platform due to fatigue from seeing less useful items. Assuming a parametric stochastic model of user …

2019-01-23abs ↗pdf ↗

Diverging Flows detects extrapolations in flow models, ensuring reliable predictions.

problem Flow models extrapolate into invalid data, leading to silent failures.
method Structurally enforce inefficient transport for off-manifold inputs.
result Effective detection of extrapolations without compromising predictive fidelity or inference latency.

Develops geometric framework for analyzing big bang singularities without symmetry assumptions.

problem Analyzing big bang singularities without symmetry constraints.
method Geometric framework combined with Einstein's equations.
result Partial improvements of assumptions on expansion normalised Weingarten map and convergence of K\mathcal{K}.

Electricity production via solar energy is tackled via short-term forecasts and risk management. Our main tool is a new setting on time series. It allows the definition of "confidence bands" where the Gaussian assumption, which is not satisfied by our concrete data, may be abandoned. Those bands are quite convenient an…

2016-02-19abs ↗pdf ↗

Deep learning maps tongue movements to speech sounds for voiceless individuals.

problem Developing silent speech interfaces for individuals without a larynx.
method Hybrid spatio-temporal 3D convolutions and feature shuffling for formant estimation and tracking from ultrasound tongue images.
result Best model achieves R-squared of 99.96% for vowel formant regression.

Markov Chain Monte Carlo (MCMC) algorithms are a workhorse of probabilistic modeling and inference, but are difficult to debug, and are prone to silent failure if implemented naively. We outline several strategies for testing the correctness of MCMC algorithms. Specifically, we advocate writing code in a modular way, w…

2014-12-16abs ↗pdf ↗

The study proposes a framework to accept OOD data based on competence scores.

problem Silent failures in Domain Generalization where models reject OOD data without proper justification.
method A learning to reject framework using proxy incompetence scores to predict trustworthiness.
result Increasing incompetence scores are predictive of reduced accuracy, but not always favorable for accuracy/rejection trade-off.
Lazier ABCstat.CO

ABC algorithms involve a large number of simulations from the model of interest, which can be very computationally costly. This paper summarises the lazy ABC algorithm of Prangle (2015), which reduces the computational demand by abandoning many unpromising simulations before completion. By using a random stopping decis…

2015-01-21abs ↗pdf ↗

When modeling a probability distribution with a Bayesian network, we are faced with the problem of how to handle continuous variables. Most previous work has either solved the problem by discretizing, or assumed that the data are generated by a single Gaussian. In this paper we abandon the normality assumption and inst…

2013-02-20abs ↗pdf ↗

Study models forest transitions with deep learning for parameter estimation.

problem Complex dynamics of forest, agricultural, and abandoned lands.
method Developed a stochastic differential equation model and used deep learning for parameter estimation.
result Deep learning approach estimates model parameters from time-series data.

We present and study a Minority Game based model of a financial market where adaptive agents -- the speculators -- interact with deterministic agents -- called producers. Speculators trade only if they detect predictable patterns which grant them a positive gain. Indeed the average number of active speculators grows wi…

2001-01-22abs ↗pdf ↗

Study uses machine learning and survival analysis to predict CKD progression.

problem Early detection and management of CKD to reduce ESRD risk.
method Combines machine learning and classical statistical models to identify novel CKD progression predictors.
result Deep learning models outperform other methods in predicting CKD progression.

Semi-supervised learning algorithms typically construct a weighted graph of data points to represent a manifold. However, an explicit graph representation is problematic for neural networks operating in the online setting. Here, we propose a feed-forward neural network capable of semi-supervised learning on manifolds w…

2019-08-21abs ↗pdf ↗

Generative models learn distributions of continuous functions.

problem Training generative models on discretized grids limits model size and data type.
method Parameterize data points by continuous functions, learn distributions over these functions.
result Models can learn rich distributions of functions independently of data type and resolution.

Bayesian approach improves uncertainty in deep learning models.

problem Uncertainty quantification in deep learning models.
method Bayesian point of view, Gaussian approximability, semi-parametric Bernstein-von Mises theorems.
result Bayesian credible regions have valid frequentist coverage, providing theoretical justification for deep learning.

Research suggests using deep learning for better recommendation systems.

problem Recommender systems rely on proxies for A/B testing, leading to random success.
method Advocates for using deep learning to improve recommendation performance.
result Deep learning can potentially optimize reward in recommendation systems.

The emergence of mobile games has caused a paradigm shift in the video-game industry. Game developers now have at their disposal a plethora of information on their players, and thus can take advantage of reliable models that can accurately predict player behavior and scale to huge datasets. Churn prediction, a challeng…

2017-10-06abs ↗pdf ↗

Given a similarity graph between items, correlation clustering (CC) groups similar items together and dissimilar ones apart. One of the most popular CC algorithms is KwikCluster: an algorithm that serially clusters neighborhoods of vertices, and obtains a 3-approximation ratio. Unfortunately, KwikCluster in practice re…

2015-07-17abs ↗pdf ↗

New algorithm outperforms existing ones in multi-player bandit problems without sensing.

problem Decentralized multi-player multi-armed bandit problem without collision or sensing info.
method Randomized Selfish KL-UCB, inspired by Selfish KL-UCB, with low complexity.
result Randomized Selfish KL-UCB outperforms state-of-the-art algorithms in almost all environments.

Study shows how learning and analytical models affect reneging and jockeying in a dual M/M/1 system.

problem How do learning and analytical models affect reneging and jockeying in a dual M/M/1 system?
method Analytical and online trained actor-critic models were used to study reneging and jockeying in a dual M/M/1 system.
result Both analytical and online trained actor-critic models yield the same asymptotic limits for reneging and jockeying, but differ in practical sizes.

New method estimates hazard ratios without bias in observational studies.

problem Uninterpretable hazard ratios due to unspecified baseline hazard.
method Kernel-based machine learning to model risk set changes.
result Debiased maximum-likelihood estimators identify true hazard ratios.