The paper uses polyhedral expansions to capture the shape of compact metric spaces.
problem Capturing the shape of compact metric spaces using finite approximations.
method Inverse sequences of polyhedra based on finite approximations of a compact metric space.
result Proves the General Principle and computes inverse persistent homology groups.
Paper improves deep learning models for cardiac potential reconstruction.
problem Improving generalization of sequence models for cardiac potential reconstruction.
method Constrained stochasticity and global aggregation of temporal information in latent space.
result Improved generalization of inverse reconstruction networks.
Computational method approximates homology groups of compact metric spaces.
problem Computing homology groups of compact metric spaces.
method Inversely sequence of finite topological spaces, inverse limit, homeomorphic copy, strong deformation retract.
result Approximates homology groups of compact metric spaces.
Seismic inversion improved using semi-supervised sequence modeling.
problem Lack of geophysical constraints in machine learning seismic inversion.
method Semi-supervised sequence modeling with recurrent neural networks.
result Achieved 98% correlation between estimated and target elastic impedance.
A new compact metrizable space Z replaces X in extension theory.
problem Representing a compact metrizable space X as the limit of inverse sequences of polyhedra.
method Z is a limit of inverse sequences of simplicial polyhedra with specific bonding maps.
result Z is an absolute extensor for X, and thus for K (CW-complex absolute extensor).
In this paper we prove that if we consider the standard real metric on simplicial rooted trees then the category Tower-Set of inverse sequences can be described by means of the bounded coarse geometry of the naturally associated trees. Using this we give a geometrical characterization of Mittag-Leffler property in inve…
We construct sequences of pseudo-Anosov mapping classes whose dilatations behave asymptotically like the inverse of the Euler characteristic of the surface they are defined on. These sequences are used to show that if the genus, g, and punctures, n, of a surface are related by a rational ray g=rn then the minimal dilat…
Paper reconstructs compact metric spaces using finite approximations and inverse persistence.
problem Reconstructing the homotopy type of compact metric spaces.
method Using inverse limit of finite approximations and inverse persistence.
result Definition of inverse persistence as a new persistence process.
MCGDiff uses SGM to guide SMC for solving ill-posed linear inverse problems.
problem Solving ill-posed linear inverse problems in Bayesian settings.
method Exploiting SGM structure, defining a sequence of intermediate problems, and using SMC methods.
result MCGDiff outperforms competing methods in Bayesian ill-posed inverse problems.
We consider the geometric inverse problem of determining a closed Riemannian manifold from measurements of the heat kernel in an open subset of the manifold. In this paper we analyze the stability of this problem in the class of n-dimensional Riemannian manifolds with bounded diameter and sectional curvature. It is w…
Generation of pseudorandom numbers from different probability distributions has been studied extensively in the Monte Carlo simulation literature. Two standard generation techniques are the acceptance-rejection and inverse transformation methods. An alternative approach to Monte Carlo simulation is the quasi-Monte Carl…
Improves deep network generalization for image sequence reconstruction.
problem Improving generalization of deep networks for inverse image reconstruction.
method Proposes a network optimized by a variational approximation of the information bottleneck principle with stochastic latent space.
result Demonstrates improved generalization ability of inverse reconstruction networks through stochasticity and information bottleneck.
We show that any nontrivial reduced knot projection can be obtained from a trefoil projection by a finite sequence of half-twisted splice operations and their inverses such that the result of each step in the sequence is reduced.
Geometric framework for inverse problems using foliations and dual connections.
problem Reconstruction problems in inverse problems.
method Vaisman foliations and Atiyah--Molino sequences to induce transverse foliations and dual connections.
result Unique, path-independent reconstruction with vanishing torsion and curvature duality.
Paper clusters event sequences using a reinforcement learning approach with policy mixture model.
problem Clustering event sequences with varying temporal patterns.
method Reinforcement learning with a policy mixture model, decomposing sequences into states and actions.
result Effective clustering of event sequences into underlying policies, outperforming existing methods.
Curious examples of lifting spaces not as inverse limits of covering spaces.
problem Understanding inverse limits of covering spaces and their properties.
method Analyzing inverse limits of sequences of covering spaces over a given space.
result Presented examples of lifting spaces that cannot be obtained as inverse limits of covering spaces.
Finite approximations help reconstruct countable metric and ultrametric spaces.
problem Reconstructing countable metric and ultrametric spaces.
method Topological reconstruction using inverse limits of finite T0 spaces. result Countable metric and ultrametric spaces can be reconstructed as finite approximations.
The paper characterizes G-ANR spaces and their properties.
problem Characterizing G-ANR spaces and their properties for compact groups. method Proving conditions for a metrizable G-space to be a G-ANR. result Conditions for a metrizable G-space to be a G-ANR are provided. We introduce the problem of reconstructing a sequence of multidimensional real vectors where some of the data are missing. This problem contains regression and mapping inversion as particular cases where the pattern of missing data is independent of the sequence index. The problem is hard because it involves possibly m…
Hierarchical clustering uses OWA operators to generalize linkage methods and avoid dendrogram inversions.
problem Avoiding unaesthetic inversions in hierarchical clustering dendrograms.
method OWA-based linkages combined with the Lance-Williams formula and conditions on weight generators.
result Conditions for weight generators to produce dendrograms without inversions.
In this paper we develop the theory of Willmore sequences for Willmore surfaces in the 4-sphere. We show that under appropriate conditions this sequence has to terminate. In this case the Willmore surface either is the twistor projection of a holomorphic curve into complex projective space or the inversion of a minimal…
We state the problem of inverse reinforcement learning in terms of preference elicitation, resulting in a principled (Bayesian) statistical formulation. This generalises previous work on Bayesian inverse reinforcement learning and allows us to obtain a posterior distribution on the agent's preferences, policy and optio…
The paper shows how to use fine shape to understand infinite-dimensional spaces.
problem Understanding infinite-dimensional metrizable spaces and their homology theories.
method Obtained results indicating fine shape is tractable and can be used for Polish spaces.
result Every Polish space is fine shape equivalent to the limit of an inverse sequence of simplicial maps.
We construct an inverse system of unstable Vassiliev spectral sequences on the spaces of plumbers' knots, which model the homotopy type of the space of long knots, and show that the limit of these sequences contains the finite type invariants in their usual complexity. Utilizing the cell structure on the discriminant o…
Study on stability of Positive Mass Theorem using Inverse Mean Curvature Flow.
problem Stability of Positive Mass Theorem in foliated regions with positive scalar curvature.
method Analyzes sequences of regions foliated by solutions to Inverse Mean Curvature Flow, focusing on convergence to flat annuli under specific conditions.
result Convergence of foliated regions to flat annuli under certain conditions, leading to stability of Positive Mass Theorem.
We discuss intrinsic aspects of Krupka's approach to finite-order variational sequences. We give intrinsic isomorphisms of the quotient subsheaves of the short finite-order variational sequence with sheaves of forms on jet spaces of suitable order, obtaining a new finite-order (short exact) variational sequence which i…
A new method uses mixture approximations to improve diffusion models for Bayesian inverse problems.
problem Approximating posterior distributions in Bayesian inverse problems with intractable likelihoods.
method Proposes a mixture-based approximation of intermediate posterior distributions and uses Gibbs sampling for practical sampling.
result Validated the approach on image inverse problems and audio source separation, demonstrating improved performance.
A paper uses RL to design microfluidic flow shapes efficiently.
problem Designing complex flow shapes in microfluidics using inverse problems.
method Formulated as a Reinforcement Learning (RL) problem, trained a DoubleDQN agent.
result Success frequency reached 90% in 200,000 episodes, rewards converged.
Study inverse problems with measure samples, improving estimator calibration and recovery.
problem Inverse problems with unknown potentials observed through measure samples.
method Introduced convex empirical objectives and sharpened Fenchel--Young losses for finite-dimensional potential classes.
result High-probability parameter recovery bounds for inverse entropic unbalanced optimal transport and inverse JKO learning.
MINs learn inverse mappings for high-dimensional optimization problems.
problem Data-driven optimization with high-dimensional inputs and valid subsets.
method Model Inversion Networks (MINs) learn an inverse mapping from scores to inputs.
result MINs can scale to high-dimensional input spaces and handle both offline and active data.
SentRNA improves RNA design by integrating human strategies.
problem Designing sequences for large or complex RNA targets.
method SentRNA uses a neural network trained on human-designed RNA sequences.
result SentRNA solves complex targets previously unsolvable by machines.
Deep learning model improves seismic rock property estimation.
problem Estimating reservoir rock properties from seismic reflection data.
method Proposes a deep learning-based seismic inversion workflow that models seismic traces spatiotemporally.
result Achieves best performance on SEAM dataset with r2 coefficient of 79.77\% Inversion-free natural gradient method for Riemannian manifolds.
problem Hindered by the need for Euclidean space, Fisher information matrix inversion, and computational cost.
method Intrinsic, inversion-free natural gradient method on Riemannian manifolds, using moving approximation of inverse FIM.
result Almost-sure convergence rates and sub-quadratic storage complexity for large-scale applications.
New properties of weighted Hilbert transform derived, useful for imaging applications.
problem Properties of weighted Hilbert transform in L2 spaces.
method Derivation of Plancherel-like equations, coerciveness, iterative sequences.
result Iterative sequences for inversion are applicable to specific cases.
A new algorithm speeds up EEG source localization using ℓ1 regularization.
problem Challenging inverse problem in mapping EEG readings to brain activity.
method Formulated as a graphical generalized elastic net inverse problem, solved with a variable projected algorithm (VPAL).
result VPAL provides faster and more accurate EEG source localization compared to existing methods.
This is part 2 of a 3-part article where we provide an O(n2)-algorithm to produce a surgery presentation of a 3-manifold induced by a gem with a resolution. In this part we produce a sequence of colored simplicial 2-complexes which are inverses and dual to the sequence of gems produced in the first part. The refinem…
Researchers extend topological classification to knotted semimetals in 3D.
problem Classifying semimetals with knotted nodal lines.
method Using cohomology and Mayer-Vietoris sequence to account for nodal line semimetals with space-time inversion symmetry.
result Manifest proof of Weyl charge cancellation condition for Z_2 monopole charge.
New spatiotemporal Besov process improves CT image reconstruction and other inverse problems.
problem Handling abrupt changes and sharp contrasts in spatiotemporal data.
method Generalized Besov process (STBP) with Q-exponential process for temporal correlation.
result STBP outperforms traditional methods in dynamic reconstruction and inverse problems.
New method for IRL with missing data.
problem Recovering reward function with missing data.
method Direct computation of log-likelihood with linear equations.
result Efficient handling of missing segments in trajectories.
Robo-advisor uses ML to optimize investment performance.
problem Maximizing investment performance with historical data.
method Inverse optimization and deep reinforcement learning.
result Robo-advisor consistently outperformed S&P 500.
New approach uses inverse reinforcement learning to improve language model training.
problem Training large language models using imitation learning methods.
method Developed a new method of inverse reinforcement learning to optimize sequences directly.
result IRL-based fine-tuning leads to better performance and diversity in language generation.
Balanced shellings preserve balancedness in manifold transformations.
problem Preserving balancedness in shellings and inverse shellings of balanced manifolds.
method Established cross-flips and shellings to connect balanced manifolds, preserving balancedness.
result A sequence of cross-flips can connect any two balanced PL homeomorphic manifolds.
Study on stability of mass theorems using inverse mean curvature flow.
problem Stability of Positive Mass Theorem and Riemannian Penrose Inequality.
method Uniform control of foliations by solutions to Inverse Mean Curvature Flow.
result Convergence of regions to flat or Schwarzschild metrics under specific conditions.
Method constructs geometrical spaces from graph patterns.
problem Foundations of geometry through combinatorial methods.
method Inverse sequences of finite graphs leading to topological spaces.
result Finite graphs can approximate intrinsic geometries.
A generic degenerate Lagrangian system of even and odd variables on an arbitrary smooth manifold is examined in terms of the Grassmann-graded variational bicomplex. Its Euler-Lagrange operator obeys Noether identities which need not be independent, but satisfy first-stage Noether identities, and so on. However, non-tri…
Paper presents a unique method to recover signals from their bispectrum.
problem Retrieving signals accurately from their bispectrum.
method Two-step trust region algorithm that minimizes a non-convex objective function.
result Signals with finite spectral or temporal support can be recovered from at least 3B measurements of their bispectrum.
This paper explores and ties together three themes. The first is to establish regularity of a metric tensor, on a manifold with boundary, on which there are given Ricci curvature bounds, on the manifold and its boundary, and a Lipschitz bound on the mean curvature of the boundary. The second is to establish geometric c…
A new method for sampling complex posterior distributions in DDMs.
problem Challenging posterior distributions in DDMs.
method Divide-and-Conquer Posterior Sampling (DCPS)
result Significantly reduces approximation error without retraining.