iMATCH aligns non-contiguous chunks for iSTS with ILP and outperforms other systems.
problem Addressing iSTS with explanatory chunk alignment and score assignment.
method iMATCH uses ILP for chunk alignment and Random Forest for similarity type/score assignment.
result iMATCH outperforms other systems in alignment score and overall score for students dataset.
Decouples critic chunk length from policy to improve policy reactivity and performance.
problem Bootstrapping bias and difficulty in extracting optimal policies from chunked critics.
method Optimizes policy against a distilled critic for partial action chunks, allowing shorter chunks for policy.
result Reliably outperforms prior methods on long-horizon offline goal-conditioned tasks.
MoChA splits sequences into chunks for efficient, online attention.
problem Efficiently decoding sequence-to-sequence models with soft attention.
method Adaptive chunking of input sequences for soft attention computation.
result MoChA models achieve state-of-the-art performance in online speech recognition and document summarization.
A quantum model classifies financial sentiment by mapping text chunks to quantum circuits.
problem Classifying financial texts with high accuracy and preserving semantic information.
method Chunked diagrams are mapped to quantum circuits, with a Transformer encoder and type embeddings added for context.
result The hybrid model improves sentiment classification over a simple averaging baseline.
Q-chunking improves RL for long tasks by chunking actions.
problem Improving sample efficiency and exploration in offline-to-online RL.
method Action chunking in TD-based RL methods.
result Q-chunking outperforms prior methods on long-horizon tasks.
Streamable model improves speech recognition performance.
problem Improving speech recognition in long-form audio.
method Chunk-based attention model for streaming speech recognition.
result Streamable model maintains competitive performance and generalizes well to long-form speech.
Chunking is a significant CL problem, accounting for half of performance drop, and current methods don't address it.
problem Chunking of data in continual learning.
method Analyzing and addressing the chunking sub-problem in continual learning.
result Current CL algorithms perform poorly on chunking, only as well as plain SGD training when there is no distribution shift.
This paper uses supervised learning to predict optimal chunk-size for parallel linear algebra operations.
problem Finding the optimal chunk-size for parallel linear algebra operations.
method The paper uses supervised learning models (logistic regression, neural networks, decision trees) to predict the optimal chunk-size for multiple linear algebra operations.
result The custom decision tree model outperforms classical decision trees and other models in predicting optimal chunk-size for linear algebra operations.
Paper proposes an online speech recognition model using Transformer.
problem Challenges in deploying Transformer-based E2E ASR for online speech recognition.
method Chunk self-attention encoder (chunk-SAE) and monotonic truncated attention (MTA) based self-attention decoder (SAD).
result Achieved 23.66% CER with 320 ms latency, significant improvement over offline models.
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.
Ricci-Filtration enhances retrieval-augmented generation rerankers for query-answer tasks by using discrete Ricci flow on graphs.
problem Improving retrieval-augmented generation rerankers for query-answer tasks.
method Discrete Ricci flow on graphs to evaluate structural importance of chunks.
result Ricci-Filtration outperforms baseline methods in accuracy, precision, recall, and F1 scores.
This paper improves retrieval for LLMs in financial document Q&A.
problem Suboptimal text chunk retrieval by RAG causes inaccuracies in LLM responses.
method Sophisticated chunking techniques, query expansion, metadata annotations, re-ranking algorithms, and embedding fine-tuning.
result Enhanced retrieval quality improves LLM performance and reliability.
TMTF improves time series visualization by separating dynamic regimes.
problem Misleading global transition matrix in time series analysis.
method Temporal chunking, local transition matrices, and image assembly.
result Temporal segmentation reveals distinct transition dynamics.
CMoS improves time series forecasting with minimal parameters.
problem Efficiently forecasting time series data with limited resources.
method CMoS directly models chunk-wise spatial correlations, using Correlation Mixing and Periodicity Injection techniques.
result CMoS outperforms state-of-the-art models with minimal parameters.
SDCOR clusters massive datasets efficiently, detecting outliers with low memory usage.
problem Local outlier detection in large-scale datasets.
method Chunk-based density clustering with incremental updates.
result SDCOR achieves lower linear time complexity and better efficiency than traditional methods.
GTI network learns linguistic features for multi-task sequence tagging.
problem Improving neural model performance on multi-task sequence tagging without explicit features.
method GTI network with neural gate modules to learn relations between tasks.
result GTI network outperforms baselines on chunking and NER tasks.
FinFlowRL combines imitation and reinforcement learning for better financial control.
problem Traditional stochastic control methods fail in real-world finance due to changing market conditions.
method FinFlowRL uses imitation learning to pretrain an adaptive meta policy, then finetunes it with reinforcement learning.
result FinFlowRL consistently outperforms individual strategies across various market conditions.
tsflex speeds up time series processing and feature extraction.
problem Inefficient and inflexible time series processing tools.
method Flexible Python toolkit exttttsflex for multivariate, asynchronous time series. result Significantly faster and more memory-efficient than existing packages.
ReWTS ensemble improves time-series forecasting by adapting to changing dynamics.
problem Complex, multi-faceted, evolving data in process industries.
method Chunk-based, recency-weighted temporal segmentation of data for multi-step forecasting.
result Significantly outperforms conventional models in mean squared forecasting error.
UIClust efficiently clusters data streams with concept drift detection.
problem Efficiently clustering data streams with concept drift detection.
method Incremental clustering algorithm with concept drift detection.
result UIClust outperforms existing techniques in clustering and concept drift detection.
Study improves understanding of what makes machine learning explanations human-interpretable.
problem Understanding what makes explanations human-interpretable in machine learning systems.
method Controlled human-subject experiments to identify regularizers for interpretability across three tasks.
result Cognitive chunks affect performance more than variable repetitions, suggesting common design principles.
KATA improves associative recall by optimizing feature maps derived from nonnegative attention weights.
problem Linear attention's poor performance on associative recall tasks.
method Formulates attention recall as a spherical-packing problem and introduces Kernelized Linear Attention Activations (KATA).
result KATA features offer a favorable capacity-interference tradeoff, enabling efficient associative recall.
Framework for lifelong learning of compositional structures.
problem Learning to reuse self-contained chunks of knowledge for novel problems.
method Separates learning into combining existing components and adapting them.
result Framework handles trade-off between stability and flexibility.
Improved speech enhancement with MNTFA using time-frequency attention.
problem Speech enhancement with limited model size and memory.
method Designing MNTFA with self-attention modules for long sequences and joint training.
result MNTFA achieves better performance with fewer parameters than DPCRN.
A new framework uses directed information to efficiently select context chunks.
problem Efficiently selecting relevant context chunks for query understanding.
method Directed Information γ-covering framework, formulated as a γ-cover problem, with a greedy algorithm for context selection. result The γ-covering algorithm provides clear advantages in hard-decision regimes like context compression and single-slot prompt selection. Spatial SVM decompositions improve training and testing speed.
problem Expensive SVM optimization for large datasets.
method Spatially defined data chunks for decomposition.
result Decomposition significantly faster during testing and reduces test error.
Paper proposes an active multi-step TD algorithm for reinforcement learning.
problem Challenging decision making and control tasks in reinforcement learning.
method Active stepsize learning and adaptive multi-step TD algorithm with context-aware mechanism.
result Competitive results compared to other reinforcement learning baselines on discrete and continuous space tasks.
New method for clustering large multi-view data.
problem Handling large multi-view data efficiently.
method Incremental minimax optimization based fuzzy clustering (IminimaxFCM).
result IminimaxFCM outperforms related methods in clustering accuracy.
One of the limiting factors of using support vector machines (SVMs) in large scale applications are their super-linear computational requirements in terms of the number of training samples. To address this issue, several approaches that train SVMs on many small chunks of large data sets separately have been proposed in…
In-Place TTT enhances LLMs with dynamic parameter updates at inference time.
problem Static training limits LLMs from adapting to new information.
method In-Place TTT updates a subset of model parameters (fast weights) at inference time.
result In-Place TTT enables 4B-parameter models to outperform on tasks with up to 128k contexts.
FinReflectKG - EvalBench benchmarks financial KG extraction from SEC 10-K filings.
problem Lack of universal benchmark and evaluation framework for financial KG construction.
method Agentic and holistic evaluation principles, deterministic commit-then-justify judging protocol, binary and ordinal evaluations.
result Reflection-based extraction outperforms single-pass extraction in comprehensiveness, precision, and relevance.
Inspired by the hierarchical hidden Markov models (HHMM), we present the hierarchical semi-Markov conditional random field (HSCRF), a generalisation of embedded undirectedMarkov chains tomodel complex hierarchical, nestedMarkov processes. It is parameterised in a discriminative framework and has polynomial time algorit…
Method prevents model divergence in rapidly changing ad markets.
problem Model divergence due to rapid ad turnover and discontinuity.
method Dual ascent optimization with latent vector constraints.
result Significant reduction in diverging instances and improved user experience/revenue.
Bayesian Neural Networks detect gravitational wave events with high accuracy and real-time potential.
problem Detecting and identifying the full duration of compact binary coalescence events in gravitational wave data.
method Integrating Bayesian approach into a CLDNN classifier that combines CNN and LSTM for event detection and uncertainty estimation.
result Successfully detected all seven BBH events in LIGO Livingston O2 data with high accuracy.
This paper surveys scalable automated alignment methods for LLMs.
problem Scalability issues in traditional human-annotated alignment methods for LLMs.
method Categorizes and discusses various automated alignment methods.
result Emerging automated alignment methods are effective and scalable.
Inference-aware meta-alignment of LLMs reduces computational cost.
problem Aligning LLMs to diverse human preferences is challenging due to conflicting criteria.
method IAMA trains a base model to be aligned to multiple tasks via different inference-time alignment algorithms, using non-linear GRPO for optimization.
result IAMA enables effective alignment of LLMs to multiple criteria with limited computational budget.
Conformal Alignment ensures trustworthy outputs from foundation models.
problem Ensuring outputs from foundation models align with human values in high-stakes tasks.
method A framework that trains an alignment predictor using reference data to select trustworthy outputs.
result Conformal Alignment accurately identifies trustworthy outputs via lightweight training over moderate reference data.
Study evaluates manifold alignment methods for noisy double pendulum dynamics.
problem Aligning manifolds of double pendulum dynamics under noise.
method Compared four manifold alignment methods: semi-supervised feature-level global and local.
result Local alignment methods were more robust to noise and faster.
NCRF transducers improve sequence labeling across tasks.
problem Sequence labeling with non-linear node potentials.
method Two RNNs: one for features and one for long-range label dependencies.
result Consistent improvements over linear-chain NCRFs and RNN transducers.
LPL optimizes embeddings to align local neighborhoods, improving cross-lingual word alignment.
problem Aligning embeddings across different datasets and languages.
method Locality Preserving Loss (LPL) optimizes model to project embeddings while maintaining local neighborhoods and aligning them.
result LPL-based alignment leads to better and consistent accuracy, especially in small training set settings.
Extends reinforcement learning alignment to scalar rewards, improving math reasoning.
problem Designing reinforcement learning algorithms for general LLM alignment.
method Introduces f-GRPO and f-HAL, estimating f-divergences between reward-aligned and unaligned distributions.
result Improves math reasoning RLVR tasks and mitigates reward hacking.
The paper proposes a learning-theoretic perspective on representation alignment.
problem Understanding how AI models' representations become aligned as they scale.
method Reviewing and connecting different notions of alignment, focusing on stitching.
result Relating properties of stitching to kernel alignment of representations.
Aligns databases with Gaussian features using MAP estimation and thresholding.
problem Aligning databases with jointly Gaussian features.
method Two algorithms: MAP estimation and thresholding of log likelihood ratios.
result Conditions on mutual information for reliable performance of algorithms.
Paper proposes unsupervised knowledge graph alignment with adversarial learning.
problem Aligning knowledge graphs from different sources or languages without large amounts of aligned triplets.
method Adversarial learning framework to align entity and relation embeddings, with mutual information regularization.
result Framework effectively aligns knowledge graphs in unsupervised and weakly-supervised settings.
Survey of alignment techniques for large language models.
problem Ensuring large language models align with human values.
method Analysis of diverse alignment methods and training paradigms.
result Preference-based methods offer more flexibility for nuanced alignment.
MAD learns alignments between data points from multiple views.
problem Finding correspondences across different data views.
method Probabilistic model for learning alignments between data points and views.
result MAD can recover a global alignment from a few aligned examples.
FinFlowRL learns from experts to optimize financial control in changing markets.
problem Traditional finance control methods fail in real-world, non-stationary markets.
method Imitation-Reinforcement Learning framework that pretrains on expert strategies and finetunes in noise space.
result Consistently outperforms individually optimized experts across diverse market conditions.
The paper addresses rigid alignment of noisy patches, providing a polynomial time algorithm and convergence conditions.
problem Finding a rigid alignment of overlapping local views (patches) that minimizes alignment error in a noisy setting.
method Characterizes non-degeneracy based on kernel and positivity of a matrix, provides polynomial time algorithm for testing non-degeneracy, and uses Riemannian gradient descent for alignment.
result The algorithm converges locally linearly to a non-degenerate perfect alignment under certain conditions.