Study improves machine learning models for GI tract disease detection using comprehensive evaluations and cross-dataset testing.
problem Incomplete or incorrect evaluation of machine learning models for GI tract diseases.
method Comprehensive evaluations of five machine learning models using Global Features and Deep Neural Networks, introducing performance hexagons and cross-dataset testing.
result Demonstrates the need for more sophisticated performance metrics and evaluation methods to build generalizable models.
Unsupervised method detects earthquakes from raw waveforms, generalizing across datasets.
problem Lack of labeled data for earthquake detection.
method Uses deep autoencoders with cross-covariance triggering at bottleneck.
result Performance comparable to supervised methods, with strong cross-dataset generalization.
Method embeds numeric tabular datasets into a shared vector space for similarity and retrieval.
problem Lack of meaningful representation for numeric tabular datasets in large language models.
method Structured exploratory data analysis descriptors, sentence transformer embedding, CCA for cross-dataset alignment.
result Total P@1 score of 0.9 across 15 datasets, robust nearest-neighbor retrieval and cluster structure.
MusPy is a toolkit for symbolic music generation, providing tools for dataset management and analysis.
problem Facilitating the creation and analysis of symbolic music datasets.
method Development of an open-source Python library (MusPy) with features for dataset management, data I/O, preprocessing, and model evaluation. Demonstrated through statistical analysis and cross-dataset generalizability experiments.
result MusPy's dataset analysis reveals varying degrees of cross-genre representation across different music datasets.
Study shows different trajectory prediction models generalize better under OoD conditions.
problem Comparing trajectory prediction models' robustness across different datasets.
method Training models on Argoverse 2 and testing on Waymo Open Motion, and vice versa, with various augmentation strategies.
result Smallest model with highest inductive bias performs best in OoD generalization.
Study reveals how spectral bias affects learnability on real-world data.
problem Understanding how well complex datasets can be learned using kernel methods.
method Use eigenvalues and eigenfunctions from idealized data to reveal spectral bias on real-world data.
result Bound learnability on real-world data using symmetries of realistic kernels.
Automatic speech emotion recognition provides computers with critical context to enable user understanding. While methods trained and tested within the same dataset have been shown successful, they often fail when applied to unseen datasets. To address this, recent work has focused on adversarial methods to find more g…
Parametric models, and particularly neural networks, require weight initialization as a starting point for gradient-based optimization. Recent work shows that a specific initial parameter set can be learned from a population of supervised learning tasks. Using this initial parameter set enables a fast convergence for u…
Paper proposes a method to improve building extraction from aerial images by adapting CNN models.
problem Limited generalization of CNN-based segmentation models for unseen images.
method Combines domain transfer and adversarial attack concepts to adapt input images to target images.
result Improves overall IoU and outperforms other methods in cross-dataset experiments.
Study categorizes time series anomaly detection metrics based on evaluation challenges.
problem Challenges in evaluating time series anomaly detection due to diverse application objectives and metric assumptions.
method Problem-oriented framework categorizing metrics into six dimensions based on evaluation challenges.
result Quantifies each metric's discriminative ability and reveals limitations of widely used metrics.
Donor-aware scRNA-seq benchmarks improve classification accuracy in inflammatory bowel disease.
problem Influenza disease classification from scRNA-seq data is prone to donor-level confounding.
method Developed and evaluated three feature representations across two IBD cohorts.
result Compartment-stratified CLR composition and GatedStructuralCFN embeddings outperform linear models in classification accuracy.
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.
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.