Paper tackles DNN defects by analyzing data flow footprints.
problem Detecting defects in DNN models due to low precision.
method Developed DeepMorph to analyze data flow footprints for root cause identification.
result DeepMorph can guide DNN developers to improve model quality.
Flow cytometry is often used to characterize the malignant cells in leukemia and lymphoma patients, traced to the level of the individual cell. Typically, flow cytometric data analysis is performed through a series of 2-dimensional projections onto the axes of the data set. Through the years, clinicians have determined…
A new Helmholtzian operator from point clouds for flow analysis.
problem Analyzing flows and vector fields on manifolds from point cloud data.
method Estimation of manifold Helmholtzian from point cloud data using weighted 1-Laplacian.
result The Helmholtzian operator L1 effectively smooths, predicts, and extracts features from flows on manifolds. Predicts short-term futures contract direction using neural networks and order flow data.
problem Challenges in predicting short-term directional movement of futures contracts.
method Engineering features from technical analysis, order flow, and order-book data; training a Tabnet neural network.
result Achieved an accuracy of 0.601 in predicting directional change on the Silver Futures Contract.
Physics-guided neural network improves power flow analysis.
problem Infeasibility of traditional numerical approaches due to outdated or unavailable PF equations.
method Proposes a physics-guided neural network to learn PF mappings from historical data while constraining by physical laws.
result Physics-guided neural network achieves better performance and generalizability than unconstrained data-driven approaches.
The article analyzes the stability of a curve shortening flow for planar networks.
problem Stability analysis of anisotropic curve shortening flow for planar networks.
method Used Lojasiewicz-Simon gradient inequality to derive stability results.
result For initial data close to an energy minimizer, the flow exists globally and converges to a different energy minimum.
Flow-based models generate data with improved theoretical guarantees.
problem Theoretical analysis of flow-based generative models.
method Proximal gradient descent in Wasserstein space for JKO flow model.
result KL guarantee of data generation by JKO flow model is O(ε2). Enhances multimodal generation with Normalizing Flows and correlation analysis.
problem Generating coherent cross-modal data from multiple sources.
method Uses Deep Canonical Correlation Analysis for shared information, Normalizing Flows for diversity, and Product of Experts for scalability.
result Improves likelihood, diversity, and coherence in conditional generation.
Study shows different behaviors of noncompact hypersurfaces under mean curvature flow.
problem Analyzing stability of noncompact hypersurfaces with curvature blowup.
method Numerical overlap method to construct global solutions.
result Existence of near and far classes of initial data leading to distinct behaviors.
Paper analyzes convergence of ODE samplers in Wasserstein distances.
problem Limited theoretical understanding of convergence properties of probability flow ODEs.
method Convergence analysis for general probability flow ODEs in 2-Wasserstein distance.
result First non-asymptotic convergence analysis for probability flow ODE samplers.
Analysis of flow cytometry data is an essential tool for clinical diagnosis of hematological and immunological conditions. Current clinical workflows rely on a manual process called gating to classify cells into their canonical types. This dependence on human annotation limits the rate, reproducibility, and complexity …
SFM generates smooth functional data without exposing real data.
problem Challenges in statistical analysis of functional data.
method Copula framework and smooth flow construction.
result SFM produces high-quality synthetic functional data.
Copula-based normalizing flows improve flexibility and stability for heavy-tailed data.
problem Limited expressive power of vanilla normalizing flows.
method Generalize base distribution to copula for more accurate representation of target distribution.
result Copula-based normalizing flows improve flexibility, stability, and effectiveness for heavy-tailed data.
New method simplifies ideal curve flow with length constraint.
problem Analyzing ideal curve flow with length constraint.
method Introduced length constraint to simplify sixth order curvature flow.
result Flow exists for all time and converges to a round circle.
We apply network Lasso to semi-supervised regression problems involving network structured data. This approach lends quite naturally to highly scalable learning algorithms in the form of message passing over an empirical graph which represents the network structure of the data. By using a simple non-parametric regressi…
Study proposes curvature flow model for Drosophila dorsal closure.
problem Modeling and understanding Drosophila dorsal closure during embryonic development.
method Curvature-based mathematical model, analysis of maximum-principle and integral-estimates, numerical approximation scheme.
result Established global existence and convergence for the model.
This paper designs sensor arrays for estimating unsteady flows efficiently.
problem Estimating high-dimensional unsteady flow fields with limited sensor placement.
method Combines data-driven modeling, Kalman Filter design, and sparsification for sensor selection.
result Proposed sensor arrays are highly effective for flow-field estimation across various conditions.
Urban spatial-temporal flows prediction is of great importance to traffic management, land use, public safety, etc. Urban flows are affected by several complex and dynamic factors, such as patterns of human activities, weather, events and holidays. Datasets evaluated the flows come from various sources in different dom…
Three geometric analysis results on curve flows and Lie groups.
problem Analyzing geometric flows and Lie groups.
method Curve-shortening flow, point-wise curvature preserving flow, Lie group analysis.
result Interpolation between Sol and hyperbolic space in Lie groups.
Investigates stability of piecewise flat Ricci flow using analysis and simulations.
problem Stability of piecewise flat Ricci flow.
method Linear stability analysis and numerical simulations.
result Adaptations avoided numerical instability and led to convergence to smooth solutions.
We prove that for the mean curvature flow of two-convex hypersurfaces the intrinsic diameter stays uniformly controlled as one approaches the first singular time. We also derive sharp Ln−1-estimates for the regularity scale of the level set flow with two-convex initial data. Our proof relies on a detailed analysis…
We investigated financial market data to determine which factors affect information flow between stocks. Two factors, the time dependency and the degree of efficiency, were considered in the analysis of Korean, the Japanese, the Taiwanese, the Canadian, and US market data. We found that the frequency of the significant…
Rectified flows achieve optimal sample complexity for generating data.
problem Generating high-quality data samples efficiently.
method Rectified flows constrain transport trajectories to be linear, enabling efficient sampling.
result Achieve sample complexity of ildeO(ε−2), matching optimal rate for mean estimation. Unified Bayesian framework for PTA data analysis tackles hierarchical model issues.
problem Hierarchical Bayesian modeling challenges in PTA data analysis.
method Reparameterization strategy using Normalizing Flows (NFs) and i-nessai nested sampler.
result Improved statistical robustness and computational efficiency in PTA analysis.
The study finds static solutions in symplectic curvature flow in 4D.
problem Finding static solutions in symplectic curvature flow in 4D.
method Derived a local normal form for static solutions and used Cartan-Kahler theorem for solitons.
result Every complete static solution to symplectic curvature flow in 4D is Kahler-Einstein.
Machine learning (ML) algorithms and machine learning based software systems implicitly or explicitly involve complex flow of information between various entities such as training data, feature space, validation set and results. Understanding the statistical distribution of such information and how they flow from one e…
Latent Noise Injection improves synthetic data generation for privacy and statistical alignment.
problem Slow convergence of generative models in high-dimensional settings.
method Latent Noise Injection using Masked Autoregressive Flows (MAF).
result Synthetic data closely reflects the underlying distribution, especially in high-dimensional settings.
The in-game economies of massively multi-player online games (MMOGs) are complex systems that have to be carefully designed and managed. This paper presents the results of an analysis of auction house data from the MMOG Glitch, across a 14 month time period, the entire lifetime of the game. The data comprise almost 3 m…
A new method models individual survival curves using conditional normalizing flows.
problem Precise per-individual predictions in survival analysis.
method Conditional normalizing flows for flexible and individualized survival distributions.
result Efficient estimation of individual survival curves without overfitting.
This paper improves flow models to better handle perturbations in real-world data.
problem Flow models amplify initial errors in perturbed data, leading to poor generalization.
method Utilizes Bernstein-type polynomials to construct Normalizing Flows (NF) for higher robustness.
result Proposed NF framework provides theoretical upper bounds and practical advantages.
Study of Anosov flows using microlocal analysis for ergodicity and mixing properties.
problem Ergodicity and mixing properties of Anosov flows and their isometric extensions.
method Microlocal analysis of Pollicott-Ruelle resonances to study isometric extensions of Anosov flows.
result Ergodicity of frame flow on negatively-curved Riemannian manifolds under specific curvature assumptions.
The paper shows that ancient noncollapsed mean curvature flows have a blowdown of at most n-2 dimensions.
problem Understanding the blowdown of ancient noncollapsed mean curvature flows.
method Fine cylindrical analysis and fine neck analysis generalization.
result The blowdown of ancient noncollapsed mean curvature flows is at most n-2 dimensional.
The execution flow drives market dynamics, validated on real data.
problem Understanding the fundamental driving force of market dynamics.
method Developed a numerical framework using the Radon-Nikodym derivative to calculate execution flow and determined thresholds and characteristic time scales.
result Execution flow is the fundamental driving force of market dynamics.
We consider closed immersed hypersurfaces in R3 and R4 evolving by a class of constrained surface diffusion flows. Our result, similar to earlier results for the Willmore flow, gives both a positive lower bound on the time for which a smooth solution exists, and a small upper bound on a power of the total cur…
Study XRP network, propose Flow Index to analyze transaction frequencies.
problem Analyze transaction frequencies in XRP network.
method Analyze XRP transaction history, propose Flow Index.
result Flow Index reveals bow-tie/walnut structure in XRP network.
Ancient pancake solutions found for curvature flows.
problem Finding unique ancient solutions to curvature flows.
method Constructing and analyzing O(1)imesO(n)-invariant ancient solutions. result Unique O(n)-invariant ancient solutions found. Discussing curvature flows and their applications.
problem Analyzing expanding curvature flows.
method Classical aspects of expanding curvature flows.
result First applications of curvature flows.
Paper disproves potential singularity models for 3D hypersurfaces in R^4.
problem Noncollapsed wing-like flows as singularity models for mean curvature flow in R^4.
method Fine bubble-sheet analysis generalizing fine neck analysis.
result Ancient noncollapsed flows in R^4 are always simple geometric shapes, not wedges.
Method extracts taint flows to classify Bitcoin mining pools.
problem Understanding pseudonymous Bitcoin actors and their transactions.
method Taint analysis and graph embedding methods applied to taint flows.
result Taint flows from the same period show high similarity.
Proposes ρ-GNF for sensitivity analysis of unobserved confounding.
problem Sensitivity analysis of unobserved confounding in observational studies.
method Copulas and normalizing flows to estimate average causal effect (ACE) as a function of unobserved confounding strength.
result Develops ρcurve to provide bounds for ACE and identify confounding strength required to nullify ACE. This study reduces Willmore flows of tori to simpler problems and finds new conformally constrained Willmore tori.
problem Analyzing singularities and existence of Willmore tori under specific constraints.
method Dimension reduction approach, strong relation with elastic flow, necessary condition for singularities, criterion for initial data.
result Existence of new conformally constrained Willmore tori and identification of inverted catenoid as a limit shape.
Local singularity analysis for Ricci flows with applications to bounded scalar curvature.
problem Understanding the nature of singularities in Ricci flows.
method Local singularity analysis, introducing Type I and Type II singular points, and proving curvature blow-up rates.
result Ricci curvature must blow up at least at a Type I rate near singular points of a Ricci flow.
Model uses Navier-Stokes equations to assess liquidity and systemic risk.
problem Traditional models fail to capture real market fluctuations and extreme events.
method Develops and validates a mathematical model based on Navier-Stokes equations, incorporating 13 macroeconomic and financial parameters.
result Model effectively describes liquidity dynamics, systemic risk, and extreme scenarios.
Unified error analysis for discrete flow models.
problem Error analysis of discrete flow models.
method Stochastic calculus theory, Girsanov theorem, generator matching, uniformization.
result First error analysis for discrete flow models.
Paper improves normalizing flows to better capture distribution tails.
problem Difficult to learn tail behavior of distributions.
method Develops a new type of flows using flexible base distributions and data-driven linear layers.
result Improves accuracy, especially on distribution tails, and generates heavy-tailed data.
Modeling influenza spread using feature engineering and international flow deconvolution.
problem Predicting and mitigating influenza spread through feature extraction and international flow analysis.
method Discrete Fourier Transform, matrix completion, SVM, autoencoders, PCA, deconvolution of international flow.
result Significant environmental and economic features are crucial to influenza mortality.
Graphs model human mobility patterns, reducing errors in data matching.
problem Lack of high-quality data and computational resources for graph-based mobility analysis.
method Embedding graphs into a continuous space to address matching, modeling, and visualization challenges.
result Approx 40% decrease in error on average in matched graphs vs unmatched ones.
Identifies most probable flows for Kunita SDEs in fluid dynamics.
problem Modeling stochastic processes with Eulerian noise and deterministic drifts.
method Equipping the domain with a Riemannian metric from the noise, solving the resulting PDEs.
result Most probable flows differ from deterministic flows, especially under noise.