PassGAN uses GANs to autonomously generate passwords from real leaks, outperforming traditional methods.
problem Generating passwords efficiently and accurately using machine learning.
method PassGAN employs a Generative Adversarial Network (GAN) to learn password distributions from real leaks.
result PassGAN outperforms traditional password guessing tools, especially in generating a large number of high-quality guesses.
Safe-House secures DeFi by limiting losses and enhancing security.
problem Ongoing hacks and security concerns in DeFi.
method Safe-House uses blockchain principles to secure asset movements.
result Safe-House limits maximum one-time loss to specified limits.
First differentially private mechanism for anonymized histograms.
problem Protecting sensitive data in anonymized histograms.
method Proposes a differentially private mechanism for releasing anonymized histograms.
result Achieves near-optimal privacy utility trade-off in terms of number of items and privacy parameter.
Machine learning detects phishing websites by identifying common characteristics.
problem Phishing websites deceive users and steal sensitive information.
method Compared multiple machine learning methods for predicting phishing websites.
result Machine learning can identify common characteristics of phishing websites.
Enhanced ECG biometric system improves authentication accuracy.
problem Traditional authentication methods have security issues.
method Developed an ECG-based authentication system using machine learning.
result Achieved up to 92% identification accuracy.
This paper uses deep reinforcement learning to detect phishing websites.
problem Detecting and preventing phishing websites to protect user data.
method Introduces a novel deep reinforcement learning model for phishing website detection.
result The model can adapt to the dynamic nature of phishing websites.
Study provides long-term EMG data for multi-day biometric authentication.
problem Limited long-term EMG data for multi-day biometric authentication.
method Collected EMG data from 43 participants over three days.
result Multi-day biometric authentication results in low error rates.
New system uses wearable bio-signals for easy authentication.
problem Security of private information on wearables is a concern.
method Context-dependent soft-biometric authentication using heart rate, gait, and breathing audio.
result Binary SVM with RBF kernel achieves high accuracy and low EER.
The abstract extends twistor construction to manifolds with generalized metrics.
problem Extending twistor construction to manifolds with generalized metrics.
method Defining generalized twistor space and finding integrability conditions for intrinsic isomorphisms.
result Existence of intrinsic isomorphisms in generalized twistor spaces.
The paper explores twistor spaces for generalized quaternionic manifolds.
problem Integrability of generalized almost complex structures on generalized quaternionic manifolds.
method Survey of twistor theory for hypercomplex and quaternionic manifolds, introduction of the generalized Bismut connection.
result Provides an integrability criterion for generalized almost complex structures on generalized hyperkähler manifolds.
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 paper finds a criterion for generating commuting pairs of structures.
problem Defining commuting pairs of generalized structures on product spaces.
method Proves a theorem for generating commuting pairs of generalized almost complex structures.
result Simple criterion for generating commuting pairs of generalized structures.
New method trains generative models by reversing generator maps.
problem Training deep neural network generators.
method Non-parametrically estimate flexible code distributions by reversing generator maps.
result More powerful generative models, better latent structure modeling, explicit generalization control.
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.
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.
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.
Characterizes structures on generalized tangent bundles and CRF-structures.
problem Understanding structures on generalized tangent bundles and CRF-structures.
method Equivalent characterizations and spinor formalism for CRF-structures.
result Characterization of generalized complex manifolds as products and infinitesimal deformations of CRF-structures.
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.
The scalar curvature is redefined in generalized Kahler geometry as a moment map.
problem Defining scalar curvature in generalized Kahler geometry.
method Introducing a moment map in generalized Kahler geometry to define a generalized scalar curvature.
result Infinitesimal deformations of generalized Kahler structures with constant generalized scalar curvature are finite-dimensional.
Study blow-ups in generalized complex geometry using holomorphic ideals.
problem Blow-ups in generalized complex geometry.
method Introduce holomorphic ideal to define blow-ups in smooth manifolds. Identify suitable submanifolds and provide conditions for blow-ups.
result Necessary and sufficient conditions for generalized Poisson submanifolds to carry a canonical holomorphic ideal and for blow-ups to be generalized complex.
A group fails a conjecture, constructed by researchers.
problem Generalized Burghelea Conjecture
method Constructed a specific group
result Failed to satisfy the generalized Burghelea conjecture
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.
Deep generative models learn to generalize from a single example.
problem Learning to generalize from a single example.
method Developed deep generative models combining deep learning and Bayesian reasoning, incorporating feedback and attention.
result Models can generate compelling and diverse samples from a single example.
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.
ORGAN uses GANs and RL to generate sequences with desired metrics.
problem Generating sequences with specific metrics.
method Combines GANs and RL to bias sequence generation.
result Successfully biases generation towards desired metrics in various tasks.
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…
Proposes models to generate more interesting story endings.
problem Generating diverse and interesting story endings for a given context.
method Trains models to focus on keyphrases and promotes non-generic words.
result Models generate more diverse and interesting story endings.
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.
An algorithm finds minimal generators for braid centralizers efficiently.
problem Finding minimal generators for braid centralizers efficiently.
method Using Garside theory, an algorithm computes minimal generators in quadratic time.
result The centralizer of a generic braid has a minimal set of generators with quadratic complexity.
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.
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.
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.