Area-charge inequalities and local rigidity of free boundary MOTS in charged initial data sets
problem Area-charge inequalities and local rigidity of free boundary MOTS in charged initial data sets
method Area-charge inequalities and local rigidity of free boundary MOTS in charged initial data sets
result Prove area-charge inequalities for free boundary MOTS in initial data sets for the Einstein-Maxwell equations with vanishing magnetic fields
Study finds rigid properties of boundary-free hypersurfaces in specific data sets.
problem Rigidity of free boundary hypersurfaces in initial data sets with boundary.
method Extending local splitting theorems and applying results on free boundary MOTS.
result Rigidity results for compact free boundary hypersurfaces in initial data sets with boundary.
Researchers create a method to join hyperboloidal data sets without violating the shear-free condition.
problem Creating consistent initial data sets for simulations of spacetime.
method Developed a new gluing procedure that maintains the shear-free condition using special Hölder spaces and elliptic operators.
result Successfully constructed hyperboloidal initial data sets that preserve the shear-free condition.
DeepInversion generates images from trained networks without additional data.
problem Generating images from trained networks without real data.
method Inverting a trained network to synthesize images from random noise, optimizing using batch normalization layers and maximizing Jensen-Shannon divergence.
result Synthesized images from CIFAR-10 and ImageNet datasets show high fidelity and realism.
Optimizes data power control in cell-free networks for better spectral efficiency.
problem Maximizing overall spectral efficiency in cell-free networks with multi-objective optimisation.
method Applied scalable multi-objective Bayesian optimisation to solve convergence-time limitations.
result Improved radio resource management in cell-free networks.
Efficiently distills pretrained text-to-image models without real data, improving FID and CLIP scores.
problem Slow iterative refinement process of diffusion-based text-to-image models.
method Guided Score identity Distillation with Long and Short Classifier-Free Guidance.
result Achieves state-of-the-art FID performance with competitive CLIP score.
This study benchmarks likelihood-free inference methods for models with heavy-tailed or discrete data.
problem Comparing likelihood-free inference methods for models with structural features like heavy-tails or discreteness.
method Four approaches: MLE, NBE, EOT, and AW-NBE are evaluated using simulations.
result The choice of evaluation tools is crucial for models with extremes and discrete data.
Study on random knot diagrams and their probability of forming specific knots.
problem Understanding the probability of forming specific knots from random knot diagrams.
method Analyzing free knot diagrams without over/under information and proving trefoil formation; making conjectures about unknot and trefoil probabilities.
result Every free knot diagram produces trefoil knots, and certain families of diagrams are completely worked out.
Framework reuses pre-trained models for data-free transfer learning.
problem Challenges in retrieving source data for model training.
method Model Recycling Framework for parameter-efficient training.
result Makes multi-source data-free supervised transfer learning possible.
New algorithm provides robust uncertainty quantification without parameter tuning.
problem Real-world machine learning predictors need reliable uncertainty quantification.
method Parameter-free, group-conditional online prediction algorithm.
result Achieves best group-conditional coverage guarantees.
DAD++ improves test-time adversarial defense without access to training data.
problem Improving adversarial robustness of pre-trained models without access to training data.
method Test-time Data-free Adversarial Defense (DAD++) with detection and correction schemes.
result DAD++ significantly improves adversarial robustness with minimal clean accuracy drop.
Framework for training-free guidance in discrete diffusion models for molecular generation.
problem No equivalent training-free guidance methods for discrete diffusion models.
method Framework using guidance functions for discrete data.
result Demonstrated utility on molecular graph generation tasks.
Paper proposes a data-free adversarial distillation method.
problem Tackles the challenge of model compression without real-world data.
method Introduces a novel adversarial distillation mechanism to craft a compact student model without any real-world data.
result Demonstrates comparable performance to data-driven methods and achieves state-of-the-art results in semantic segmentation.
TASFAR adapts regression models without labeled source data.
problem Lack of labeled source data for domain adaptation.
method Uses prediction confidence to estimate target label distribution and calibrate source model.
result Substantially reduces errors in various regression tasks.
Bayesian inference learns free energy landscapes from experimental data.
problem Characterize the free energy landscape of classical many-body systems from experimental data.
method Combines non-parametric Bayesian inference with physically-motivated constraints to automate the construction of approximate free energy functionals.
result Inference algorithms yield a probability distribution over free energy functionals, leading to highly accurate analytic expressions.
In this paper we introduce a Guan-Li type volume preserving mean curvature flow for free boundary hypersurfaces in a ball. We give a concept of star-shaped free boundary hypersurfaces in a ball and show that the Guan-Li type mean curvature flow has long time existence and converges to a free boundary spherical cap, pro…
Proves properties of free boundary stable MOTS in spacetimes.
problem Topology of black hole spacetimes in manifolds with boundary.
method Initial data version of Hawking's theorem, foliation by MOTS, vanishing null second fundamental form.
result Compact free boundary stable MOTS in initial data sets with boundary are of positive Yamabe type.
Likelihood-free inference is concerned with the estimation of the parameters of a non-differentiable stochastic simulator that best reproduce real observations. In the absence of a likelihood function, most of the existing inference methods optimize the simulator parameters through a handcrafted iterative procedure tha…
The study finds conditions for free boundary Hamiltonian stationary discs in complex 2-space.
problem Conditions for free boundary Hamiltonian stationary Lagrangian discs in complex 2-space.
method Established conditions for weakly conformal, branched Ω-free boundary Hamiltonian stationary Lagrangian immersions of discs. result If conditions are met, a disc is a free boundary minimal immersion.
We consider the Einstein-Maxwell-fluid constraint equations, and make use of the conformal method to construct and parametrize constant-mean-curvature hyperboloidal initial data sets that satisfy the shear-free condition. This condition is known to be necessary in order that a spacetime development admit a regular conf…
The paper proposes a method for distribution-free prediction sets that adapt to unknown temporal changes.
problem Distribution-free prediction sets require reliable calibration data, which is often unavailable in real-world settings with temporal changes.
method The method selects an adaptive window to construct prediction sets, optimizing a bias-variance tradeoff.
result The method provides sharp coverage guarantees and is shown to be adaptive to temporal drift through numerical experiments.
New study tackles free-rider attacks in federated learning models.
problem Free-rider attacks compromise federated learning models by non-contributing to data updates.
method Theoretical and experimental analysis of iterative federated learning schemes, including FedAvg and FedProx.
result Formal guarantees for free-rider attacks to converge to aggregated models of fair participants.
We show that any polyhomogeneous asymptotically hyperbolic constant-mean-curvature solution to the vacuum Einstein constraint equations can be approximated, arbitrarily closely in Hölder norms determined by the physical metric, by shear-free smoothly conformally compact vacuum initial data.
Automatically learns summary features from time series data for likelihood-free inference.
problem Necessity of hand-tailored summary features for time series data in likelihood-free inference.
method Data-driven approach to automatically learn summary features.
result Learning summary features from data can outperform hand-crafted values in likelihood-free inference.
Generates consistent IV surfaces using VAEs and SDE models.
problem Creating arbitrage-free IV surfaces from historical data.
method Combining VAEs with SDE models for parameter distribution, sampling, and decoding.
result Superior out-of-sample performance of the refined VAE model.
Study three types of uncertainty quantification for binary classification without distributional assumptions.
problem Uncertainty quantification for binary classification in a distribution-free setting.
method Established theorems connecting calibration, confidence intervals, and prediction sets for score-based classifiers.
result Distribution-free calibration is only possible using scoring functions that partition feature space into countably many sets.
We introduce a framework using Generative Adversarial Networks (GANs) for likelihood--free inference (LFI) and Approximate Bayesian Computation (ABC) where we replace the black-box simulator model with an approximator network and generate a rich set of summary features in a data driven fashion. On benchmark data sets, …
The paper tackles uncertainty quantification for classification under label shift without assuming i.i.d. data.
problem Uncertainty quantification for classification under label shift in non-i.i.d. settings.
method The paper uses conformal prediction and post-hoc binning for distribution-free UQ, and reweights these methods for label shift.
result The reweighted methods improve UQ performance under label shift, preserving coverage and calibration.
Mobile networks possess information about the users as well as the network. Such information is useful for making the network end-to-end visible and intelligent. Big data analytics can efficiently analyze user and network information, unearth meaningful insights with the help of machine learning tools. Utilizing big da…
Develops a nonparametric model for arbitrage-free pricing of illiquid derivatives.
problem Modeling joint dynamics of liquid vanilla options for arbitrage-free pricing of illiquid derivatives.
method Derives a state space for prices respecting underlying financial constraints using neural networks and imposes constraints to preserve no-arbitrage conditions.
result Neural SDE models are guaranteed to satisfy a set of linear inequalities and validated with numerical experiments.
Likelihood-free inference involves inferring parameter values given observed data and a simulator model. The simulator is computer code which takes parameters, performs stochastic calculations, and outputs simulated data. In this work, we view the simulator as a function whose inputs are (1) the parameters and (2) a ve…
EnVAE uses energy score for likelihood-free VAEs, improving image reconstructions.
problem Likelihood misspecification in VAEs leads to blurry reconstructions and poor data fidelity.
method Deterministic decoder, energy score as reconstruction loss, fast variant for efficiency.
result EnVAE achieves superior reconstruction and generation quality compared to likelihood-based baselines.
Improves likelihood-free inference by using a new sampling approach to avoid biased data collection.
problem Efficient Bayesian inference without likelihood evaluation for real-world datasets.
method Introduces Neural Proposal (NP) to sample simulation inputs i.i.d. for unbiased posterior inference.
result Demonstrates improved performance, especially for multi-modal posteriors, through experiments.
The paper studies the free elastic flow of closed curves and finds their asymptotic shape converges to a circle.
problem Challenges in studying the asymptotic behavior of the free elastic flow for closed curves.
method Analysis of the free elastic flow as an L2-gradient flow for Euler's elastic energy. result An appropriate rescaling of initial curves geometrically close to circles converges to a unique round circle.
CN-DPM model tackles task-free continual learning for neural networks.
problem Current continual learning methods are limited to task-boundary known settings.
method CN-DPM uses a neural Dirichlet process mixture model for expansion-based task-free learning.
result CN-DPM successfully performs task-free continual learning for image classification and generation.
Simple image augmentation boosts deep RL from pixels.
problem Training deep RL models from raw pixel inputs is challenging.
method Applying standard computer vision data augmentation to reinforcement learning.
result Our method significantly improves SAC's performance on DeepMind control suite.
A new feature selection method using random forest and Kolmogorov filter.
problem Ultra-high dimensional data feature selection.
method Fused Kolmogorov filter with random forest based recursive feature elimination.
result Selection and L2 consistency under weak conditions. In this paper, we compute the Morse index for a free boundary minimal submanifold from data of two simpler problems. The first one is the corresponding problem with fixed boundary condition; and the second is associated with the Dirichlet-to-Neumann map for Jacobi fields. As an application, we show that the Morse index…
A new model-free subsampling method using uniform designs is proposed.
problem Model-based subsampling methods are often dependent on model assumptions.
method Developed a criterion (GEFD) and a model-free subsampling method based on uniform designs.
result The proposed method outperforms random sampling and is robust under diverse model specifications.
ALFI improves likelihood-free inference for black-box generators.
problem Limitations of likelihood-free inference on black-box generators.
method Adversarial Likelihood-Free Inference (ALFI) to estimate posterior distributions.
result ALFI achieves best parameter estimation accuracy with limited simulation.
We propose a parallel-data-free voice-conversion (VC) method that can learn a mapping from source to target speech without relying on parallel data. The proposed method is general purpose, high quality, and parallel-data free and works without any extra data, modules, or alignment procedure. It also avoids over-smoothi…
A new method reduces dimensionality for better likelihood-free parameter estimation.
problem Estimating parameters from data with no closed-form likelihood.
method Combines reconstruction map estimation with dimension-reduction techniques.
result The proposed method outperforms existing techniques in accuracy and efficiency.
Parameter-free clustering method using cluster catch digraphs (CCDs).
problem Finding the correct number of clusters in data without specifying a parameter.
method Hybrid of density-based and graph-based clustering methods using Ripley's K function.
result Minimum dominating sets of RK-CCDs estimate and distinguish clusters from noise.
No free lunch theorems suggest inductive biases are needed, but we show neural networks prefer low-complexity data.
problem The need for inductive biases in machine learning.
method Analysis of Kolmogorov complexity and neural network behavior on various datasets.
result Neural networks prefer low-complexity data, suggesting inductive biases are not always necessary.
Unified framework for data-free sampling using Wasserstein gradient flows.
problem Efficient sampling from unnormalized distributions without data.
method Unified theoretical framework based on Wasserstein gradient flows.
result Unified form of velocity field for various f-divergences.
New algorithms achieve high-probability parameter-free regret in online convex optimization with heavy-tailed data.
problem Achieving high-probability parameter-free regret in online convex optimization with heavy-tailed data.
method Developed new regularization techniques to handle exponentially large iterates and heavy-tailed subgradients.
result Achieved regret bound of O(∥u∥T1/plog(1/δ)) with high probability for subgradients with bounded pth moments. New methods compress models without real data, reducing accuracy loss.
problem Compression requires real data, which is often unavailable or sensitive.
method Synthetic data generation from trained models for calibration and fine-tuning.
result Best method shows negligible accuracy loss compared to original training set.
We develop an online learning method for prediction, which is important in problems with large and/or streaming data sets. We formulate the learning approach using a covariance-fitting methodology, and show that the resulting predictor has desirable computational and distribution-free properties: It is implemented onli…