Subanalytic sets offer a model for semi-supervised learning on singular data
A new arXiv paper proposes a mathematical framework for semi-supervised learning when data lies on singular sets.
Preprints and papers, rewritten in plain English.
A new arXiv paper proposes a mathematical framework for semi-supervised learning when data lies on singular sets.
A new arXiv paper applies conditional diffusion models to limit order book forecasting, addressing a gap in existing snapshot models.
A proposed benchmark shifts evaluation of retrieval-augmented language models from qualitative overlap to structured, domain-specific extraction in perovskite photovoltaics.
A new self-supervised model improves out-of-distribution generalization for solubility, a key property in drug discovery and chemical engineering.
A new arXiv paper introduces a sparse batch-mixing method to improve parallel sampling and aggregation in sequence models.
New research challenges the common assumption that only harmful fine-tuning data poses safety risks, showing that benign fine-tuning can also cause misalignment.
A new approach applies adversarial post-training to limit order book foundation models, addressing the compounding sampling errors left unpenalized by standard pre-training.
A new paper proposes a factorized tabular foundation model to overcome a trade-off in current architectures.
A new arXiv paper uses large language models to model how human decisions in the Prisoner's Dilemma diverge from rational choice.
A new open-weight framework aims to preserve linguistic style in machine translation, especially for non-Western languages.
A new arXiv study finds that curriculum learning can teach large language models to reason implicitly over long horizons, but the approach still hits performance cliffs.
A new arXiv paper tackles the challenge of making LLM-generated survey respondents reflect real population diversity.
A new approach uses divergence measures to align large language models with ranked feedback, capturing richer signal than pairwise comparisons.
A new search-based approach allocates inference cache budgets across transformer layers instead of using a uniform budget.
A new arXiv study uses an established programming taxonomy to test which variable-role distinctions language models can recover from code representations.
A new framework aims to keep learned policies from failing when deployment conditions differ from the observational data they were trained on.
A new arXiv paper describes prefix-tuning, a method that steers pretrained transformers by prepending task-specific prefixes rather than retraining all parameters.
A new evaluation, OR-License, asks whether LLM agents can solve operations research problems directly from original client materials, without expert reformulation.