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

Trend · papers per month

128257385513 · Jun 202019922001200920172026
48 results for fine-grained prediction

Considering event structure information has proven helpful in text-based stock movement prediction. However, existing works mainly adopt the coarse-grained events, which loses the specific semantic information of diverse event types. In this work, we propose to incorporate the fine-grained events in stock movement pred…

2019-10-11abs ↗pdf ↗

DistPre predicts traffic speeds efficiently for large networks.

problem Fine-grained, accurate speed prediction for large-scale transportation networks.
method Customizes LSTM models on a cluster, sharing trained models between detectors.
result Efficient and accurate fine-grained traffic-speed prediction.

As entity type systems become richer and more fine-grained, we expect the number of types assigned to a given entity to increase. However, most fine-grained typing work has focused on datasets that exhibit a low degree of type multiplicity. In this paper, we consider the high-multiplicity regime inherent in data source…

2017-04-25abs ↗pdf ↗

Predicts fine-grained OD matrices for ridesharing platforms to optimize supply-demand balance.

problem Accurately predicting spatial-temporal OD demands for ridesharing platforms.
method OD-CED model combining unsupervised space coarsening and encoder-decoder architecture.
result Significant improvement in prediction accuracy (45% RMSE reduction, 60% WAPE reduction).

Generative framework learns effective, lower-dimensional models from high-dimensional data.

problem Predicting long-term behavior of complex, multiscale systems with limited data.
method Physics-aware probabilistic model order reduction with latent variables.
result Guaranteed long-term stability and predictive accuracy in multiscale physical systems.

Pipelined Backpropagation trains large models without batches efficiently.

problem Training large models efficiently on hardware with limited batch sizes.
method Fine-grained Pipelined Backpropagation with Spike Compensation and Linear Weight Prediction.
result Fine-grained Pipelined Backpropagation with a batch size of one matches the accuracy of SGD for multiple networks.

ECC Analyzer uses LLMs to predict stock volatility from ECCs.

problem Leveraging unstructured ECC data for stock volatility prediction.
method Uses large language models to extract and fuse textual and audio features from ECCs.
result ECC Analyzer outperforms traditional benchmarks in volatility prediction.

Heterogeneous GNN improves species distribution modeling.

problem Predicting species occurrences and habitat suitability using environmental factors.
method Graph Neural Networks (GNN) for presence-only species distribution modeling.
result Heterogeneous GNN model outperforms single-species SDMs and baseline models.

Generative profiling improves real-time task timing for varied resource contexts.

problem Inaccurate task timing analysis for complex hardware architectures.
method Nonparametric, conditional multi-marginal Schrödinger Bridge (MSB) formulation for synthesizing context-dependent timing profiles.
result Maximum likelihood accurate execution profiles for unseen resource contexts.

CSNE embeds signed networks by separating structural and fine-grained information.

problem Improving sign prediction in signed networks using inaccurate or incomplete balance theories.
method Conditional Signed Network Embedding (CSNE) models structural and fine-grained information separately, integrating them rigorously.
result CSNE outperforms state-of-the-art on sign prediction tasks, and MaxEnt priors are competitive in resource-constrained settings.

New framework learns labels at both bag and graph levels.

problem Learning multi-label classifiers from multi-graph bags.
method Designing scoring functions and rank-loss objective for graph and bag levels; developing sub-gradient descent algorithm.
result Superior performance over state-of-the-art algorithms.

Fine-grained gap-dependent regret bounds for reinforcement learning.

problem Achieving optimal regret bounds for reinforcement learning with suboptimality gaps.
method Developed novel analytical frameworks and refined algorithms for UCB-based and non-UCB-based reinforcement learning.
result Established the first fine-grained gap-dependent regret bounds for both UCB-based and non-UCB-based algorithms.

The ubiquitous deployment of monitoring devices in urban flow monitoring systems induces a significant cost for maintenance and operation. A technique is required to reduce the number of deployed devices, while preventing the degeneration of data accuracy and granularity. In this paper, we present an approach for infer…

2020-02-05abs ↗pdf ↗

We study how the behavior of deep policy gradient algorithms reflects the conceptual framework motivating their development. To this end, we propose a fine-grained analysis of state-of-the-art methods based on key elements of this framework: gradient estimation, value prediction, and optimization landscapes. Our result…

2018-11-06abs ↗pdf ↗

The objective of this work is to take advantage of deep neural networks in order to make next day crime count predictions in a fine-grain city partition. We make predictions using Chicago and Portland crime data, which is augmented with additional datasets covering weather, census data, and public transportation. The c…

2018-06-05abs ↗pdf ↗

Paper tackles bias-variance trade-off in missing data, proposing a dynamic framework.

problem Missing data in practical applications deteriorates model performance.
method Develops a fine-grained dynamic learning framework to jointly optimize bias and variance.
result Theoretical and empirical validation of joint bias-variance optimization.

We propose a novel approach for generating unrestricted adversarial examples by manipulating fine-grained aspects of image generation. Unlike existing unrestricted attacks that typically hand-craft geometric transformations, we learn stylistic and stochastic modifications leveraging state-of-the-art generative models. …

2019-11-20abs ↗pdf ↗

New method uses LLMs to generate detailed scientific hypotheses.

problem Generating detailed, actionable scientific hypotheses from coarse initial directions.
method Hierarchical search method that incrementally adds details to hypotheses.
result Hierarchical search method consistently outperforms strong baselines on expert-annotated hypotheses.

Improved investment performance with fine-grained LLM tasks.

problem Abstract financial trading systems often overlook real-world workflow intricacies, leading to degraded performance.
method Proposes a multi-agent LLM trading framework that decomposes investment analysis into fine-grained tasks.
result Fine-grained task decomposition significantly improves risk-adjusted returns compared to coarse-grained designs.

Solves dual imbalance in detecting sparse anomalies in MIL.

problem Detecting scarce and sparse anomalous samples in MIL.
method Reformulates MIL as a fine-grained PU learning problem, addressing imbalance at both macro and micro levels.
result Demonstrates effectiveness of BFGPU framework on synthetic and real-world datasets.

PSimGNN partitions graphs into subgraphs for efficient graph similarity computation.

problem Efficiently compute graph similarity scores for large graphs.
method Graph partitioning followed by subgraph-level and node-level comparisons using a graph neural network.
result PSimGNN outperforms state-of-the-art methods in graph similarity computation tasks.

The paper develops a framework for abstracting causal models using category theory.

problem Difficulties in changing the variables used to describe a system, especially from fine-grained to coarse-grained.
method Introduces a category of interventional causal models and uses enriched category theory to prove compositionality properties.
result Compositionality of model transformations is established, with bounded errors for each step.

Efficiently evaluate generative models at the prompt level using tensor factorization.

problem Fine-grained evaluations of generative models are costly and often misaligned with human judgment.
method Tensor factorization model that merges cheap autorater data with a small set of human gold-standard labels.
result The method provides accurate and tight confidence intervals for model performance.

Transformers can be hijacked by context, but deeper models are more robust.

problem Robustness of Transformers against context hijacking for linear classification.
method Developed a theoretical analysis on the robustness of linear transformers, considering model depth, training context lengths, and number of hijacking context tokens.
result Deeper transformers are more robust to context hijacking.

Sentiment classification is an important process in understanding people's perception towards a product, service, or topic. Many natural language processing models have been proposed to solve the sentiment classification problem. However, most of them have focused on binary sentiment classification. In this paper, we u…

2019-10-04abs ↗pdf ↗

Paper tackles cross-granularity few-shot learning with meta-embedder.

problem Few-shot learning with coarse labels and fine-grained testing.
method Meta-embedder that optimizes visual and semantic discrimination across coarse and fine classes.
result Meta-embedder achieves effective cross-granularity few-shot classification.