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

3026059071,209 · Jun 202019922001200920172026
48 results for online text data

Paper proposes using online text data to predict CPI with LLMs.

problem Forecasting Consumer Price Index (CPI) using low-frequency survey-based data.
method Develops an LLM-based approach combining online text time series with monthly CPI data.
result Establishes the asymptotic properties and provides prediction intervals for CPI forecasts.

Loss Data Analytics is an interactive, online, freely available text. The idea behind the name Loss Data Analytics is to integrate classical loss data models from applied probability with modern analytic tools. In particular, we seek to recognize that big data (including social media and usage based insurance) are here…

2018-08-20abs ↗pdf ↗

Proposes RTL model for sentiment classification and key word detection in online reviews.

problem Sentiment classification and key word detection in online reviews for hospitality industry.
method Regularized Text Logistic (RTL) regression model.
result RTL model achieves satisfactory classification performance and identifies key word features.

AOBTM adapts online topic modeling for short app reviews, revealing coherent topics over time.

problem Challenges in inferring latent topics from short, dynamic app reviews over multiple versions.
method Adaptive Online Biterm Topic Model (AOBTM) that addresses sparsity and considers statistical data from previous versions.
result AOBTM finds more coherent topics and outperforms state-of-the-art baselines.

A new reinforcement learning framework separates users into risk-tolerant and risk-averse groups for better performance.

problem Improving performance for risk-averse users in reinforcement learning.
method Introducing a tiered reinforcement learning approach with two policies: πextOπ^{ ext{O}} and πextEπ^{ ext{E}}.
result Achieving constant regret for risk-averse users, independent of the number of episodes.

We propose two algorithms that can find local minima faster than the state-of-the-art algorithms in both finite-sum and general stochastic nonconvex optimization. At the core of the proposed algorithms is One-epoch-SNVRG+\text{One-epoch-SNVRG}^+ using stochastic nested variance reduction (Zhou et al., 2018a), which outperforms the s…

2018-06-22abs ↗pdf ↗

The paper analyzes online learning of smooth functions in both single and multi-variable settings.

problem Online learning of smooth functions with known smoothness properties.
method Analyzes classes of absolutely continuous functions and their properties, proving bounds and exact results.
result Sharp bounds and exact results for optimal prediction errors in various classes of smooth functions.

In text classification, the problem of overfitting arises due to the high dimensionality, making regularization essential. Although classic regularizers provide sparsity, they fail to return highly accurate models. On the contrary, state-of-the-art group-lasso regularizers provide better results at the expense of low s…

2018-07-12abs ↗pdf ↗

To help enforce data-protection regulations such as GDPR and detect unauthorized uses of personal data, we develop a new \emph{model auditing} technique that helps users check if their data was used to train a machine learning model. We focus on auditing deep-learning models that generate natural-language text, includi…

2018-11-01abs ↗pdf ↗

Unified analysis of online optimization with self-concordant barriers, improving regret bounds.

problem Online convex optimization with specific loss functions.
method Online mirror descent with self-concordant barriers and logarithmic loss.
result Improved regret bounds for online portfolio selection and quantum state learning.

New algorithms achieve optimal regret in sliding window model with limited memory.

problem Experts problem in the sliding window model with limited information.
method 2 queries, polylog(nT) memory, exponential improvement on memory.
result Achieve optimal regret of sqrt(nW)polylog(nT) with 2 queries and polylog(nT) memory.

One important partition of algorithms for controlling the false discovery rate (FDR) in multiple testing is into offline and online algorithms. The first generally achieve significantly higher power of discovery, while the latter allow making decisions sequentially as well as adaptively formulating hypotheses based on …

2019-10-11abs ↗pdf ↗

Kernel online convex optimization (KOCO) is a framework combining the expressiveness of non-parametric kernel models with the regret guarantees of online learning. First-order KOCO methods such as functional gradient descent require only O(t)\mathcal{O}(t) time and space per iteration, and, when the only information on t…

2017-06-15abs ↗pdf ↗

The study bounds errors in learning smooth functions online.

problem Investigating worst-case error bounds for online learning of smooth functions.
method Analyzing the class of absolutely continuous functions with smoothness constraints and proving bounds on prediction errors.
result Proved bounds on the sum of the pextthp^{ ext{th}} powers of absolute prediction errors for any number of trials.

AdaptOn achieves logarithmic regret in adaptive control of unknown partially observable linear systems.

problem Adaptive control in partially observable linear dynamical systems.
method AdaptOn algorithm that estimates system dynamics through online learning and gradient descent.
result AdaptOn achieves a logarithmic regret bound of polylog(T) after T steps.

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 ↗

To identify and classify toxic online commentary, the modern tools of data science transform raw text into key features from which either thresholding or learning algorithms can make predictions for monitoring offensive conversations. We systematically evaluate 62 classifiers representing 19 major algorithmic families …

2018-10-03abs ↗pdf ↗

We study optimal regret bounds for control in linear dynamical systems under adversarially changing strongly convex cost functions, given the knowledge of transition dynamics. This includes several well studied and fundamental frameworks such as the Kalman filter and the linear quadratic regulator. State of the art met…

2019-09-11abs ↗pdf ↗

Topic sparsity refers to the observation that individual documents usually focus on several salient topics instead of covering a wide variety of topics, and a real topic adopts a narrow range of terms instead of a wide coverage of the vocabulary. Understanding this topic sparsity is especially important for analyzing u…

2018-10-22abs ↗pdf ↗

Sequences of correlated binary patterns can represent many time-series data including text, movies, and biological signals. These patterns may be described by weighted combinations of a few dominant structures that underpin specific interactions among the binary elements. To extract the dominant correlation structures …

2019-01-22abs ↗pdf ↗

Develops platforms to analyze social media data for human behavior and emotions.

problem Understanding human behavior and emotions from social media data.
method Self-structuring incremental machine learning, event detection, natural language processing.
result Captured salient topics and events from social media data, validated against news.

Many modern applications deal with multi-label data, such as functional categorizations of genes, image labeling and text categorization. Classification of such data with a large number of labels and latent dependencies among them is a challenging task, and it becomes even more challenging when the data is received onl…

2018-04-04abs ↗pdf ↗

Extends algorithms for computing ΦΦ-equilibria to higher polynomial dimensions.

problem Computing ΦΦ-equilibria for higher-dimensional polynomial deviations.
method Nested application of the EAH algorithm to handle polynomial dimension.
result Efficient algorithms for computing εε-approximate ΦΦ-equilibria and online ΦΦ-regret.

The paper develops a method to identify LLM-generated text without training.

problem Identifying LLM-generated text among human-generated content.
method Modeling LLM text as a sequential process and designing zero-shot statistical tests.
result The method can distinguish between text from known LLMs and non-sanctioned models with low false positive rates.

Unified approach to RLHF tackles uncertainty in reward function.

problem Uncertainty in reward function learned from human feedback.
method Value-incentivized preference optimization (VPO) that regularizes the reward function with value function.
result Theoretical and practical guarantees for both online and offline RLHF settings.

Social Media has influenced the way people socially connect, interact and opinionize. The growth in technology has enhanced communication and dissemination of information. Unfortunately,many terror groups like jihadist communities have started consolidating a virtual community online for various purposes such as recrui…

2019-07-22abs ↗pdf ↗

Online shopping caters to the needs of millions of users daily. Search, recommendations, personalization have become essential building blocks for serving customer needs. Efficacy of such systems is dependent on a thorough understanding of products and their representation. Multiple information sources and data types p…

2019-06-28abs ↗pdf ↗