Linguistic calibration improves long-form text confidence.
problem LMs hallucinate, leading to suboptimal decisions.
method Defining linguistic calibration, training framework, reinforcement learning.
result Llama 2 7B is significantly more calibrated than baselines.
New method predicts nonfactuality in LLM responses using semantic isotropy.
problem Assessing trustworthiness of long-form LLM responses efficiently.
method Semantic isotropy of text embeddings on the unit sphere.
result Higher semantic isotropy correlates with lower factual consistency.
Adaptive Nucleus Truncation Improves Long-Form Reasoning
problem Improving long-form reasoning in language models
method Adaptive Nucleus Truncation Sampling (ANTS)
result Significant performance gains across various benchmarks
Paper introduces a conformer-based system for streaming language identification in long-form speech.
problem Language identification in long-form audio.
method Conformer layers with attentive temporal pooling and domain adaptation.
result Conformer-based models significantly outperform LSTM and transformer models.
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.
Model criticism tool evaluates text coherence and structure in generated long-form text.
problem Evaluate the high-level structure of generated text for coherence, coreference, and topicality.
method Apply model criticism in latent space to compare real and generated data distributions.
result Transformer-based models struggle with maintaining structural coherence and coreference.
Express improves causal attention guarantees for language models.
problem Improving causal attention guarantees for language models.
method Introducing Express, a tool for converting non-causal attention into causal with matching guarantees.
result Express improves causal attention guarantees to log^(3/2)(n)/s with minimal memory and compression overhead.
New framework tackles deep financial reporting bottleneck by improving hallucination and coherence.
problem Statistical smoothing trap in LLMs limits deep financial reporting quality.
method DeepNews Framework integrates information foraging, schema-guided planning, and adversarial prompting.
result DeepNews system achieves 25% acceptance rate in blind test, significantly outperforming SOTA.
IPO Finance Agent extends Finance Agent v2 for SpaceX S-1 filings, improving accuracy and cost-efficiency.
problem Evaluating IPO due diligence tasks with long-form documents.
method Extended task domain, improved agentic harness with contextual retrieval, automated rubric generation.
result Best-performing model reaches 79.8% accuracy, cost-efficient model at 77.2% with 0.05 USD per query.
Paper defines generalized braids and proves their subgroup status.
problem Understanding the structure of generalized braids and knots.
method Defined generalized braid theories and computed their generating sets.
result Quasitoric normal generalized braids form a subgroup of normal generalized braid group.
Defines a new Poisson structure for generalized Sasakian spaces.
problem No specific problem stated; focuses on new structure definition.
method Defines a canonical Poisson structure on generalized contact metric spaces.
result Shows distinction between generalized Sasakian and coKähler structures.
Improved image generation through iterative flow matching to reduce hallucinations.
problem Hallucinations in image generation models.
method Iterative flow matching to refine and correct paths in generative models.
result Enhanced generative modeling with reduced unrealistic images.
Plug-and-play multimodal controller improves class-conditional image generation.
problem Generating class-conditional images from user-specified labels.
method Introduces a `multimodal controller` to generate multimodal data without additional learning parameters.
result Multimodal controlled generative models produce higher quality class-conditional images and novel modalities.
Framework generates personalized insulin treatment strategies using deep models.
problem Developing optimal personalized treatment strategies for diabetes patients.
method Combines deep generative time series models with decision theory.
result Demonstrated improved personalized insulin treatment strategies for diabetes patients.
OptiGAN uses GAN and RL to optimize sequence generation for specific goals.
problem Challenging in sequence generation tasks to generate sequences with specific desired goals.
method Integrates GAN and RL to optimize desired goal scores using policy gradients.
result Achieves higher desired scores in text and real-valued sequence generation.
Survey on deep models for graph generation.
problem Improving fidelity of generated graphs.
method Taxonomy and comparison of deep generative models.
result Advances in deep generative models for graph generation.
Improves deep generative models to generate images of any size.
problem Fixed-sized output images from deep generative models.
method Integrates spatial noise vectors into fully convolutional neural networks.
result Theoretical interpretation of infinite spatial generation using spatial stochastic processes.
Develops a unified theory of Yang-Mills and GR using generalized principal bundles.
problem Combining Yang-Mills theories and General Relativity into a single framework.
method Using generalized principal bundle theory, the authors develop a new approach to field theories.
result Recover General Relativity within the framework of generalized principal connections.
Meta-CoTGAN improves adversarial text generation by preventing mode collapse.
problem Mode collapse in adversarial text generation.
method Meta-Cooperative Training Paradigm with a language model.
result Meta-CoTGAN effectively slows down mode collapse and improves generation quality and diversity.
Generative models can still learn from contaminated data, but with limitations.
problem How much contamination can generative models tolerate?
method Characterized robustness under contaminated enumerations, proving generation is achievable for all countable collections if contamination fraction converges to zero.
result Generation under contamination is achievable for all countable collections if contamination fraction converges to zero, but dense generation is strictly less robust.
Generative AI tasks analyzed for text, images, audio, video, code, and molecules.
problem What is the core question when using generative AI?
method Survey of generative model families, probabilistic framework, game-theoretic setup, post-training modifications, socially responsible considerations.
result Generative AI is a distinct machine learning task with connections to prediction, compression, and decision-making.
Defines Kahler angle for a broader context.
problem Generalizing results about Kahler angle.
method Provides a general definition of Kahler angle.
result Generalized results about Kahler angle.
Established a generalized Boothby-Wang theorem in contact geometry.
problem Generalized contact structures and their properties.
method Courant reduction methods and construction of principal bundles.
result Induced symplectic foliation on leaf space under certain conditions.
The twistor construction for Riemannian manifolds is extended to the case of manifolds endowed with generalized metrics (in the sense of generalized geometry à la Hitchin). The generalized twistor space associated to such a manifold is defined as the bundle of generalized complex structures on the tangent spaces of the…
We present a characterization, in terms of torsion-free generalized connections, for the integrability of various generalized structures (generalized almost complex structures, generalized almost hypercomplex structures, generalized almost Hermitian structures and generalized almost hyper-Hermitian structures) defined …
This research proves guarantees on sequence models' generalization to longer and novel sequences.
problem Generalization to longer sequences and novel token combinations in sequence models.
method Provable guarantees on length and compositional generalization for various sequence models.
result Limited capacity models achieve both length and compositional generalization with diverse training distributions.
SHADOWCAST generates graphs with user-specified attributes.
problem Controlling graph generation with understandable structures.
method Conditional generative adversarial network guided by Markov model.
result Competitive performance in generating desired graphs.
In this paper we define the notion of a generalized coKähler structure and prove that the product M1×M2 of generalized contact metric manifolds (Mi,Φi,E±,i,Gi), i=1,2, where M1×M2 is endowed with the product generalized complex structure induced from Φ1 and Φ2, is gener…
We define the generalized connected sum for generic closed plane curves, generalizing the strange sum defined by Arnold, and completely describe how the Arnold invariants J± and St behave under the generalized connected sums.
In this communication, we describe some interrelations between generalized q-entropies and a generalized version of Fisher information. In information theory, the de Bruijn identity links the Fisher information and the derivative of the entropy. We show that this identity can be extended to generalized versions of en…
A new method generates graphs with hierarchical structures.
problem Generating graphs with natural hierarchical structures.
method Recursively generates community structures at multiple resolutions, parallel generation of all sub-structures.
result Improves generative performance on multiple graph datasets.
The paper extends symplectic techniques to generalized complex geometry.
problem Creating stable generalized complex structures on high-dimensional manifolds.
method Introducing generalized Luttinger surgery and generalized Gluck twist.
result Produced stable generalized complex structures with non-homotopy-equivalent components.
A new method for generating sets and graphs without requiring exchangeability.
problem Generating exchangeable distributions for sets and graphs is challenging.
method Top-n creation, a differentiable generation mechanism that selects relevant points from a latent vector.
result Top-n method outperforms i.i.d. generation in various tasks.
We study the problem of generating interesting endings for stories. Neural generative models have shown promising results for various text generation problems. Sequence to Sequence (Seq2Seq) models are typically trained to generate a single output sequence for a given input sequence. However, in the context of a story,…
DeepWeightFlow generates diverse neural network weights efficiently.
problem Generating complete neural network weights efficiently and accurately.
method Flow Matching in weight space with Git Re-Basin and TransFusion.
result DeepWeightFlow generates high-accuracy neural networks without fine-tuning.
Generalized tensor analysis in the sense of Colombeau's construction is employed to introduce a nonlinear distributional pseudo-Riemannian geometry. In particular, after deriving several characterizations of invertibility in the algebra of generalized functions we define the notions of generalized pseudo-Riemannian met…
It is known that the scalar curvature arises as the moment map in Kahler geometry. In pursuit of this analogy, we introduce the notion of a moment map in generalized Kahler geometry which gives the definition of a generalized scalar curvature on a generalized Kahler manifold. From the viewpoint of the moment map, we ob…
This is an expository paper, which provides a first introduction to geometric structures on TM⊕T∗M. The paper contains definitions and characteristic properties of generalized complex, generalized Kaehler, generalized (normal, almost) contact and generalized Sasakian structures. A few of these properties are n…
We characterize language generation with stability and breadth, proving impossibility results.
problem Characterizing and proving impossibility results for language generation with stability and breadth.
method Analysis of existing notions of breadth and stability, proving lower bounds.
result Proven impossibility of generating with higher perplexity or lower hallucination rate for stable generators.
Standard sequential generation methods assume a pre-specified generation order, such as text generation methods which generate words from left to right. In this work, we propose a framework for training models of text generation that operate in non-monotonic orders; the model directly learns good orders, without any ad…
Rate GENERIC extends thermodynamics principles to non-equilibrium systems.
problem Understanding non-equilibrium thermodynamics and its relation to equilibrium thermodynamics.
method Developed a geometrical framework for rate GENERIC, extending Onsager's variational principle.
result Rate GENERIC structure provides a new perspective on thermodynamics in non-equilibrium systems.
The paper defines MTCov for skewed elliptical distributions.
problem No specific problem stated, but dealing with skewed elliptical distributions.
method Defined MTCov for generalized skew-elliptical distributions and compared with skewed and non-skewed normal distributions.
result Special formula for MTCov of generalized skew-elliptical distributions.
The notion of a generalized Lie bialgebroid (a generalization of the notion of a Lie bialgebroid) is introduced in such a way that a Jacobi manifold has associated a canonical generalized Lie bialgebroid. As a kind of converse, we prove that a Jacobi structure can be defined on the base space of a generalized Lie bialg…
QGAA learns latent quantum states, reducing errors in quantum data generation.
problem Learning latent representations for quantum data generation.
method Quantum Generative Adversarial Autoencoder (QGAA) combining QAE and QGAN.
result Average errors in energies for H2 and LiH are 0.02 Ha and 0.06 Ha respectively, demonstrating QGAA's potential.
Sharpness minimization algorithms don't solely improve generalization.
problem Why do overparameterized neural networks generalize?
method Theoretical and empirical investigation of two-layer ReLU networks.
result Sharpness minimization algorithms do not always lead to better generalization.
The study shows manifolds with special generic maps also have nice multisections.
problem Characterizing manifolds with special generic maps and multisections.
method Analyzing manifolds with special generic maps and their properties, and showing how these maps restrict the differentiable structures of spheres and manifolds.
result Manifolds admitting special generic maps also admit nice generalized multisections.
Generic groups satisfy a chain condition for subgroups.
problem Understanding subgroup structures in generic groups.
method Proving for fixed integers m,t,k in generic m-generator t-relator groups. result Generic groups satisfy the Ascending Chain Condition for k-generated subgroups. In this work we present a new approach on studying dynamical systems. Combining the two ways of expressing the uncertainty, using probabilistic theory and credibility theory, we have research the generalized fractional hybrid equations. We have introduced the concepts of generalized fractional Wiener process, generaliz…