Generative model creates realistic dance poses from music.
problem Generating human-like dance poses from music.
method Music feature encoder, pose generator, music genre classifier integrated.
result Generative autoregressive model synthesizes dance sequences up to 5,000 frames.
Deep neural networks generate dance steps from music with minimal labeled data.
problem Generating dance steps from music with little labeled data and maintaining timing accuracy.
method Weakly supervised deep recurrent neural network with convolutional and LSTM layers.
result Model generates dance steps with low cross entropy and maintains timing accuracy.
Dance Dance Revolution (DDR) is a popular rhythm-based video game. Players perform steps on a dance platform in synchronization with music as directed by on-screen step charts. While many step charts are available in standardized packs, players may grow tired of existing charts, or wish to dance to a song for which no …
The waggle dance that honeybees perform is an astonishing way of communicating the location of food source. After over 60 years of its discovery, researchers still use manual labeling by watching hours of dance videos to detect different transitions between dance components thus extracting information regarding the dis…
Predicting dance hits from 1985-2013 using musical features.
problem Predicting which songs will be dance hits.
method Built a database of dance hit songs with features, used multiple classifiers.
result Best model predicts top 10 dance hits with good accuracy.
Math and dance blend in choreographer's research.
problem Exploring intersections between dance and mathematics.
method Choreographic practice and mathematical concepts.
result Examples of fractals, braids in choreography.
New AI tools generate and vary dance choreographies.
problem Creating original and customizable dance choreographies.
method Recurrent neural networks and autoencoders trained on movement data.
result Generated and varied dance sequences using machine learning.
Dancing polygons and rolling balls linked via a special geometric distribution.
problem Understanding the geometric and mechanical relationship between dancing polygons and rolling balls.
method Mapping dancing polygons to trajectories of a rolling ball on a 3D surface, both described by a specific geometric distribution.
result Non-degenerate dancing pairs of polygons exist for all n≥6 and correspond to rolling ball trajectories. DANCE improves prediction set efficiency for deep learning models.
problem Inefficient, overly conservative prediction sets for pre-trained models.
method DANCE combines adaptive kernel regression and nearest-neighbor approach.
result DANCE produces more efficient and robust prediction sets.
The "dancing metric" is a pseudo-riemannian metric g of signature (2,2) on the space M4 of non-incident point-line pairs in the real projective plane RP2. The null-curves of (M4,g) are given by the "dancing condition": the point is moving towards a point on the line, about which the li…
This paper extends danceability concept to twisted virtual knots.
problem Danceability of knot diagrams on non-orientable surfaces.
method Expanding danceability concept to twisted virtual knot diagrams.
result Danceability properties of twisted virtual knots.
DANCE optimizes neural network and accelerator design for faster, more efficient DNN execution.
problem Challenges in optimizing neural network and accelerator design for efficient DNN execution.
method Differentiable approach to co-exploration of accelerator and network architecture design.
result Significantly shorter time to achieve superior accuracy and hardware cost metrics.
RFC enhances humanoid control to imitate complex human motions.
problem Dynamics mismatch between humanoid models and real humans.
method Residual Force Control (RFC) augments control policies with external forces.
result RFC outperforms state-of-the-art methods in convergence speed and motion quality.
We present recent results on counting and distribution of circles in a given circle packing invariant under a geometrically finite Kleinian group and discuss how the dynamics of flows on geometrically finite hyperbolic 3 manifolds are related. Our results apply to Apollonian circle packings, Sierpinski curves, Schott…
DANCE method improves large-scale learning efficiency via accumulating sample strategy.
problem Efficiently solving large-scale empirical risk minimization problems.
method Distributed Accumulated Newton Conjugate gradient (DANCE) method with multistage approach.
result The method achieves satisfactory statistical accuracy with fewer passes over data.
Study identifies personality traits from dance movements in music.
problem Predicting individual differences from music-induced movement.
method Identified Big Five personality traits and EQ/SQ scores from dance movements.
result Successfully explored unseen space for personality and EQ/SQ.
DANCE improves saliency maps by adding subtle input variations.
problem Poor performance of saliency methods in saturated gradients, adversarial perturbations, and inter-feature dependence.
method Two-step procedure: 1) Perturbation mechanism, 2) Aggregation of saliency maps.
result DANCE saliency method outperforms existing methods qualitatively and quantitatively.
Products of Hidden Markov Models(PoHMMs) are an interesting class of generative models which have received little attention since their introduction. This maybe in part due to their more computationally expensive gradient-based learning algorithm,and the intractability of computing the log likelihood of sequences under…
Let P be a locally finite circle packing in the plane invariant under a non-elementary Kleinian group Gamma and with finitely many Gamma-orbits. When Gamma is geometrically finite, we construct an explicit Borel measure on the plane which describes the asymptotic distribution of small circles in P, assuming that either…
The abstract discusses a new causal structure on manifolds using paths and points.
problem Constructing a causal structure on manifolds using paths and points.
method Constructing a four-manifold from pairs of points and paths, and a seven-dimensional manifold from pairs of points and conics.
result The causal structure corresponds to a conformal structure only when the underlying surface is a real projective plane.
Many complex dynamical phenomena can be effectively modeled by a system that switches among a set of conditionally linear dynamical modes. We consider two such models: the switching linear dynamical system (SLDS) and the switching vector autoregressive (VAR) process. Our Bayesian nonparametric approach utilizes a hiera…
Double descent in portfolio optimization shows improved performance with complexity, then declines, due to overfitting.
problem Improving portfolio optimization performance with model complexity.
method Investigates the relationship between model complexity and out-of-sample performance in mean-variance portfolio optimization.
result Performance of low-dimensional models initially improves with complexity but declines due to overfitting. High-dimensional models show double ascent Sharpe ratio curve.
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.
Characterizes integrability of generalized structures on Courant algebroids.
problem Integrability of generalized structures on Courant algebroids.
method Characterization via torsion-free generalized connections and Dirac generating operators.
result Criterion for integrability of generalized almost Hermitian structures and hyper-Hermitian 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.
The study addresses exposure bias in generative models, proposing unconditional generation as a solution.
problem Exposure bias in autoregressive generative models using ground-truth contexts at training and generated ones at test.
method Combining latent variable modeling with reinforcement learning exploration, the study proposes unconditional generation as a benchmark for generalization.
result The model demonstrates improved generalization capability on language modeling and variational sentence auto-encoding tasks.
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.
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.
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 models use EOT cost for better image generation.
problem Developing models to learn implicit distributions for image generation.
method Two models: one-shot optimization with EOT cost and adversarial game with EOT cost.
result Improved image generation performance on MNSIT.
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.
Study metallic structures on generalized tangent bundles.
problem Properties of generalized metallic structures.
method Generalized geometry and suitable connections.
result Conditions for integrability of generalized metallic structures.
New method learns text generation orders without pre-specification.
problem Generating text in arbitrary orders without manual specification.
method Generates text in non-monotonic orders using a binary tree structure and imitation learning.
result Models can generate text without pre-specifying an order, achieving competitive performance.
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…
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…
Paper analyzes and improves GANs' generalization and stability.
problem Poor generalization of GANs' discriminators in practical settings.
method Proposes a zero-centered gradient penalty to improve discriminator's generalization.
result Improves GANs' generalization and convergence through the proposed penalty.
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…
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.