Online gradient descent can simulate complex computations.
problem Understanding the fine-grained behavior of online gradient descent is hard.
method Proving online gradient descent can encode arbitrary polynomial-space computations.
result It is impossible to reason efficiently about the fine-grained behavior of online gradient descent under weak complexity-theoretic assumptions.
Predicting fine-grained interests of users with temporal behavior is important to personalization and information filtering applications. However, existing interest prediction methods are incapable of capturing the subtle degreed user interests towards particular items, and the internal time-varying drifting attention …
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.
We analyze computational limits of modern Hopfield models based on pattern norms.
problem Understanding the efficiency of modern Hopfield models from a fine-grained complexity perspective.
method Fine-grained complexity analysis and upper bound criterion for pattern norms.
result Below a specific norm threshold, efficient variants of modern Hopfield models exist.
Deep learning models can have low bias and variance, contrary to classical theory.
problem Understanding the performance of deep learning models at high complexity.
method Developed a fine-grained bias-variance decomposition for random feature kernel regression, analyzing the effects of sampling, initialization, and labels.
result The variance terms exhibit non-monotonic behavior and can diverge at the interpolation boundary, even in the absence of label noise.
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.
StockEmotions dataset for financial sentiment and emotion analysis.
problem Limited resources for financial sentiment analysis.
method Collects 10,000 English comments from StockTwits, categorizes emotions into 12 classes.
result DistilBERT outperforms other models in sentiment classification, and Temporal Attention LSTM model achieves best performance in multivariate time series forecasting.
Deep policy gradient algorithms deviate from their framework's predictions.
problem Understanding the behavior of deep policy gradient algorithms.
method Fine-grained analysis of gradient estimation, value prediction, and optimization landscapes.
result The surrogate objective does not match the true reward landscape, learned value estimators fail to fit the true value function, and gradient estimates poorly correlate with the true gradient.
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…
Recent advances in Bayesian reinforcement learning (BRL) have shown that Bayes-optimality is theoretically achievable by modeling the environment's latent dynamics using Flat-Dirichlet-Multinomial (FDM) prior. In self-interested multi-agent environments, the transition dynamics are mainly controlled by the other agent'…
Replicated attention model in image classification and fine-grained recognition.
problem Improving attention mechanisms in neural networks.
method Implemented the 'Learn to Pay Attention' model in convolutional neural networks.
result Successfully replicated results in image classification and fine-grained recognition.
Proposes a method to predict stock movements using fine-grained events from finance news.
problem Lack of specific semantic information in coarse-grained events for stock movement prediction.
method Built a finance event dictionary, extracted fine-grained events, combined with stock trade data, and used distant supervision for training.
result Method outperforms all baselines and shows good generalizability.
Rugby-Bot predicts multiple metrics from a single source using fine-grain data.
problem Complexity of sporting events requires multiple metrics for accurate analysis.
method Multi-task learning with fine-grain spatial data and wide-and-deep learning.
result Predictions are consistent and can be in distribution form.
Paper presents UrbanFM and UrbanPy models for inferring fine-grained urban flows.
problem Reduce cost of urban flow monitoring while maintaining data accuracy and granularity.
method Develops UrbanFM and UrbanPy models to infer fine-grained urban flows from coarse-grained observations.
result UrbanPy model demonstrates favorable performance for larger-scale inference tasks.
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.
FIGARO generates symbolic music with fine-grained control.
problem Minimal control over generated music sequences.
method Description-to-sequence task, learning conditional distribution of sequences given high-level descriptions.
result State-of-the-art controllable symbolic music generation.
Gene expression programming predicts compression index of fine-grained soils efficiently.
problem Estimating the compression index of fine-grained soils is costly and time-consuming.
method Developed a gene expression programming model using soil parameters.
result The GEP model predicts the compression index more accurately than conventional methods.
ADSAGE detects anomalies in graph edge sequences for insider threat detection.
problem Detecting insider threats in fine-grained audit logs using graph and text features.
method Anomaly detection at edge level, supporting numeric, categorical, and text attributes.
result ADSAGE detects anomalies in authentications and email communications effectively.
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.
Graph-RISE learns image embeddings for ultra-fine-grained semantics.
problem Learning image representations for fine-grained semantics.
method Graph-regularized neural graph learning framework.
result Graph-RISE outperforms state-of-the-art on image classification and triplet ranking.
Fine-grained pretraining improves neural network's ability to learn rare features.
problem Improving generalization in deep learning models.
method Introducing a hierarchical multi-view structure to confine input data distribution.
result Fine-grained pretraining leads to better accuracy on hard downstream test samples.
Method predicts NBA players' multi-modal movement trajectories.
problem Understanding NBA players' decision-making during games.
method LSTM-based architecture with multi-modal loss function.
result Method outperforms state-of-the-art in predicting realistic trajectories.
ECN framework improves training on noisy structured labels.
problem Structured errors in fine-grained annotations lead to biased models.
method Error-Correcting Networks (ECN) framework.
result ECN improves fine-grained annotation prediction.
Paper proposes a new model for fine-grained review classification using weak supervision.
problem Fine-grained analysis of reviews is challenging due to segment-level labels.
method Employed Multiple Instance Learning (MIL) with sigmoid attention mechanism for weak supervision.
result Proposed model outperforms state-of-the-art models in segment-level sentiment classification.
VA-OPE improves OPE by incorporating variance information, achieving tighter error bounds.
problem Estimating value function of a target policy from offline data collected by a behavior policy.
method Proposes VA-OPE, an algorithm that reweights Bellman residual using estimated variance of the value function.
result Achieves a tighter error bound than the best-known result.
BERT improves fine-grained sentiment classification.
problem Fine-grained sentiment classification of text.
method Used BERT for fine-grained sentiment classification.
result BERT outperforms other models for fine-grained sentiment classification.
Action chunking and data exploration improve behavior cloning in robotics.
problem Exponential errors in learning from demonstrations for continuous control tasks.
method Action chunking and exploratory data collection.
result Control-theoretic stability is key to improving imitation learning.
Proposes a new method to generate unrestricted adversarial examples.
problem Generating unrestricted adversarial examples without norm constraints.
method Leveraging state-of-the-art generative models to manipulate image fine-grained aspects.
result Our adversarial images look indistinguishable from natural images and can bypass certified defenses.
Efficient algorithms learn from coarse labels instead of fine grained ones.
problem Learning from coarse labels when fine labels are unavailable.
method Formalized coarse label settings, used a reduction for SQs, and provided efficient algorithms.
result Any problem learnable from fine labels can be learned efficiently from coarse labels.
Predictive modeling applications increasingly use data representing people's behavior, opinions, and interactions. Fine-grained behavior data often has different structure from traditional data, being very high-dimensional and sparse. Models built from these data are quite difficult to interpret, since they contain man…
Paper relaxes stability and generalization assumptions for SGD.
problem Stability and generalization for SGD under restrictive assumptions.
method Introduces on-average model stability and develops novel bounds.
result First-ever-known fast bounds in low-noise setting using stability approach.
MACRo-mIcro VAE learns disentangled user behavior representations.
problem Complex user behavior data in recommender systems are entangled; disentangling them enhances robustness and interpretability.
method MACRo-mIcro Disentangled Variational Auto-Encoder (MacridVAE) infers high-level user intentions and micro-disentangles preferences.
result Our approach achieves substantial improvement over state-of-the-art baselines and demonstrates interpretable and controllable learned representations.
Proposes a method for weakly-supervised object localization to improve few-shot learning.
problem Challenges of few-shot learning, especially with fine-grained categories.
method Introduces a Self-Attention Based Complementary Module (SAC Module) for weakly-supervised object localization.
result Significantly outperforms state-of-the-art methods on benchmark datasets, especially for fine-grained few-shot tasks.
Two popular classes of methods for approximate inference are Markov chain Monte Carlo (MCMC) and variational inference. MCMC tends to be accurate if run for a long enough time, while variational inference tends to give better approximations at shorter time horizons. However, the amount of time needed for MCMC to exceed…
L*ReLU improves deep learning for fine-grained image classification.
problem Fine-grained image classification requires specific AFs.
method Proposes L*ReLU, piece-wise linear AFs for deep learning.
result L*ReLU achieves superior results on FGVC datasets.
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.
ImageNet models transfer well across datasets but not fine-grained ones.
problem Evaluation of transfer learning between ImageNet and other vision tasks.
method Comparison of 16 classification networks on 12 datasets, focusing on ImageNet and fine-tuned settings.
result Strong correlation between ImageNet accuracy and transfer accuracy, but limited transfer to fine-grained tasks.
We introduce SADs to reveal how network architecture shapes score-based generative models.
problem Understanding and predicting the inductive biases of score-based generative models.
method Introducing Score Anisotropy Directions (SADs) to analyze network architecture.
result SADs reliably capture model behavior and correlate with performance.
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.
We analyze the computational limits of LoRA for transformer models using fine-grained complexity theory.
problem Computational efficiency of LoRA fine-tuning for transformer models.
method Fine-grained complexity theory, identifying phase transitions, almost linear algorithms.
result Existence of almost linear algorithms for LoRA adaptation based on specific norms.
Model refines coarse spatial data using diverse auxiliary data sets.
problem Tackles the challenge of refining coarse spatial data with varying auxiliary data granularities.
method Proposes a probabilistic model using Gaussian processes to hierarchically incorporate auxiliary data sets of various granularities.
result Can effectively refine coarse-grained spatial data using auxiliary data sets of different granularities.
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.
New metric MADD assesses fairness of predictive student models.
problem Predictive student models can be biased and unfair, leading to discrimination.
method Proposes MADD metric to analyze model's discriminatory behaviors.
result Fair predictive performance does not guarantee fair behaviors or outcomes.
System identifies related passages for easier text comprehension.
problem Expensive and limited cross-reference resources for complex texts.
method Fine-grained topic modeling to find topically related verse pairs.
result System can produce cost-effective cross-references.
CLAREL improves zero-shot learning by using per-image semantic supervision and metric rescaling.
problem Fine-grained cross-modal representation learning for zero-shot classification.
method Instance-based deep metric learning in joint visual and textual space, using per-image semantic supervision and metric rescaling.
result CLAREL consistently outperforms existing approaches on fine-grained zero-shot learning datasets.
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.
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.
Unified framework for generating heavy-tailed distributions.
problem Extending SGMs to heavy-tailed targets.
method Combining early stopping with initialization for diffusion, and normalizing flows for generation.
result Unified generative framework with theoretical guarantees for heavy-tailed distributions.