Model predicts fine dust concentrations in Seoul using LSTM.
problem Predicting concentrations of fine dust in Seoul due to complex interactions.
method Used LSTM based deep learning model to capture non-linear interactions.
result Successfully predicted fine dust concentrations at 25 districts in Seoul.
Match van Stockum dust to vacuum metrics with a single parameter.
problem Matching van Stockum dust to vacuum metrics.
method 1-parametric family of non-static Papapetrou vacuum metrics, Ehlers and Kramer--Neugebauer transformations.
result Explicit examples of matching, including Bonnor metric and Lanczos--van Stockum dust metric.
The study proves strong cosmic censorship violation for spherically symmetric dust clouds.
problem Violation of strong cosmic censorship for spherically symmetric dust clouds.
method Derived an ordinary differential equation for light rays and used it to prove strong cosmic censorship violation.
result Generic violation of strong cosmic censorship for spherically symmetric dust clouds.
3D dust map of the Milky Way improves resolution and accuracy.
problem Reconstructing the 3D dust distribution in the Milky Way.
method Gaussian process regression on spherical coordinates with iterative grid refinement.
result Improved 3D dust map with increased resolution and accuracy.
Study of caustics in Einstein-dust system, showing spacetime singularities and diverging curvature.
problem Understanding caustics and singularities in the Einstein-dust system.
method Established local existence result for spherically symmetric spacetimes containing caustics, constructed from solutions to a PDE problem.
result Obtained spherically symmetric spacetimes with diverging curvature and singular boundary.
Study of convergence of point-object configurations to a charged dust continuum.
problem Understanding the convergence of discretized point-object configurations to a charged dust continuum.
method Establishing existence and uniqueness of horizons/minimal surfaces, studying geometries of regions exterior to minimal surfaces, and discussing limits.
result Examples of scalar curvature jumps upon taking Gromov-Hausdorff and intrinsic flat limits.
Study timelike bounce in charged null dust collapse, identifying key surfaces.
problem Understanding charged null dust collapse dynamics and bounce surfaces.
method Novel decoupling of equations, constructing spacetime models, solving free boundary problems.
result Timelike bounce surfaces identified in charged null dust collapse, including examples terminating in null points.
A non-elementary Möbius group generated by two-parabolics is determined up to conjugation by one complex parameter and the parameter space has been extensively studied. In this paper, we use the results of \cite{GW} to obtain an additional structure for the parameter space, which we term the {\sl two-parabolic space}. …
We show that there are isometrically nonequivalent Robertson-Walker metrics which have the same set of geodesics. While one of these metrics satisfies the Einstein equations of pure dust without a cosmological constant, all the other describe pure dust with additional energy momentum tensor of cosmological constant typ…
Researchers create a Fredholm module on fractal shapes like the Cantor set.
problem Constructing Fredholm modules on complex fractal structures.
method Combining combinatorial techniques with higher-dimensional analogues.
result Calculated Dixmier trace of operators induced by the module.
Bayesian neural flows improve Gaia distance estimates and dust modeling.
problem Improving precision of distance estimates from Gaia DR2 data.
method Normalizing flow for learning flexible color-magnitude diagrams.
result Distance posteriors improved by more than 48% over raw Gaia data.
The paper finds conditions for pseudosymmetric spacetimes to be perfect fluids.
problem Characterizing pseudosymmetric spacetimes as perfect fluids.
method Analyzes generalized Robertson-Walker spacetimes, conformally flat spacetimes, and dust fluids.
result Conditions for pseudosymmetric spacetimes to be perfect fluids are established.
Proposes MM-DUST for efficient generalized lasso solution paths.
problem Efficiently solve generalized lasso problems in large-scale and non-linear models.
method Majorization-minimization dual stagewise algorithm incorporating quadratic majorizers and stagewise learning.
result Established the uniform convergence of approximated solution paths.
The paper proves existence of solutions for Einstein-type elliptic systems on AE manifolds.
problem Analyzing semi-linear systems of partial differential equations motivated by the conformal formulation of Einstein constraint equations.
method Proving existence theorems under suitable conditions, including smallness assumptions on free parameters.
result Existence of far from CMC (near CMC) Yamabe positive (Yamabe non-positive) solutions for charged dust coupled to the Einstein equations.
We propose a geometric inequality for two-dimensional spacelike surfaces in the Schwarzschild spacetime. This inequality implies the Penrose inequality for collapsing dust shells in general relativity, as proposed by Penrose and Gibbons. We prove that the inequality holds in several important cases.
LUNAR uses cellular automata for real-time data classification in fast streams.
problem Real-time machine learning challenges with fast data streams and concept drift.
method Streamified cellular automata approach for incremental learning and adaptation.
result Competitive performance in classification compared to established online learning methods.
We prove a sharp inequality for hypersurfaces in the n-dimensional Anti-deSitter-Schwarzschild manifold for general n greater or equal to 3. This inequality generalizes the classical Minkowski inequality for surfaces in the three dimensional Euclidean space, and has a natural interpretation in terms of the Penrose ineq…
New algorithm predicts geolocation of fungi samples with high accuracy.
problem Identifying the origin of biological material at crime scenes.
method Ensemble of deep neural network classifiers trained on Voronoi partitions.
result More than half of geolocation errors under 100 kilometers for continental analysis and nearly 90% accuracy for global analysis.
Som-Raychaudhuri spacetime is a stationary cylindrical symmetric solution of Einstein field equation corresponding to a charged dust distribution in rigid rotation. The main object of the present paper is to investigate the curvature restricted geometric structures admitting by the Som-Raychaudhuri spacetime and it is …
There are certain families of words and word sequences (words in the generators of a two-generator group) that arise frequently in the Teichm{ü}ller theory of hyperbolic three-manifolds and Kleinian and Fuchsian groups and in the discreteness problem for two generator matrix groups. We survey some of the families of su…
Lipschitz equivalence of self-similar sets is an important area in the study of fractal geometry. It is known that two dust-like self-similar sets with the same contraction ratios are always Lipschitz equivalent. However, when self-similar sets have touching structures the problem of Lipschitz equivalence becomes much …
Study of Riemann solitons and η-hyperbolic Ricci solitons on Bochner-flat Lorentzian Kähler spacetime manifolds.
problem Analyzing soliton behaviors on Bochner-flat Lorentzian Kähler spacetime manifolds.
method Deriving explicit formulas for soliton parameters and analyzing their behaviors.
result Criteria for shrinking, steady, and expanding behaviors of solitons.
New measure FTC quantifies how much a ReLU network can fine-tune.
problem Analyzing memorization capacity in fine-tuned neural networks.
method Defined Fine-Tuning Capacity (FTC) for additive fine-tuning of ReLU networks.
result Upper and lower bounds on FTC for 2 and 3-layer ReLU networks.
This paper re-evaluates hyperparameters for fine-tuning pre-trained models.
problem Current hyperparameter settings for fine-tuning are often ad-hoc and fixed.
method Empirical evaluation of learning rate, batch size, and momentum for fine-tuning.
result Optimal hyperparameters are not only dataset-dependent but also sensitive to domain similarity.
New method quantifies uncertainty in fine-tuned LLMs using LoRA ensembles.
problem Uncertainty in fine-tuned LLMs and how to trust their predictions.
method Posterior approximations using low-rank adaptation ensembles.
result Unexpected retention of acquired knowledge during fine-tuning in overfitting regime.
BERT fine-tuning is unstable due to optimization issues, not forgetting or dataset size.
problem Stability of fine-tuning BERT-based models across different random seeds.
method Analysis of BERT, RoBERTa, and ALBERT fine-tuned on GLUE datasets, identifying optimization difficulties as the cause of instability.
result Fine-tuning instability is due to optimization difficulties leading to vanishing gradients, not forgetting or dataset size.
Improved code translation by preserving structure with composed fine-tuning.
problem Improving code translation accuracy with unlabeled code outputs.
method Pre-trained denoiser to capture output structure, composed fine-tuning to fine-tune predictor.
result Composed fine-tuning significantly improves generalization over standard fine-tuning.
New findings on hyperbolicity of fine curve graphs and their subgraphs.
problem Investigating hyperbolicity of fine curve graphs and their subgraphs.
method Analyzing large subgraphs of fine curve graphs and computing distances in specific cases.
result Large subgraphs of fine curve graphs contain flats of every finite dimension, indicating they are not hyperbolic.
The paper introduces a Hessian-based method to improve generalization in fine-tuned deep neural networks.
problem Improving generalization in fine-tuned deep neural networks, especially in noisy conditions.
method PAC-Bayesian analysis to identify a Hessian-based distance measure, proving generalization bounds, and developing an algorithm with a generalization error guarantee.
result Hessian-based distance measure correlates well with observed generalization gaps and can match the scale of these gaps in practice.
Extends Penrose's method to null shells with pressure and energy flux.
problem Constructing null thin shells with arbitrary gravitational/matter content.
method Derive locally Lipschitz metric and coordinate transformation.
result Example of null shell with non-trivial energy density, flux, and pressure in Minkowski space.
Homotopy types of curve and arc complexes are studied.
problem Understanding the homotopy types of curve and arc complexes.
method Proving homotopy equivalence and contractibility of complexes.
result Fine curve complex is homotopy equivalent to curve complex, fine arc complex is contractible.
Optimizes sparse fine-tuning for privacy in neural networks.
problem Performance gap between DP-SGD and non-private fine-tuning.
method Optimization-based approach using private gradient information for selecting trainable weights.
result Our selection method leads to better prediction accuracy compared to existing approaches.
Fine-tuning LLMs improves capability but harms safety, study finds.
problem Balancing capability and safety in LLM fine-tuning.
method Theoretical framework and numerical experiments for two safety-aware fine-tuning strategies.
result Characterization of fundamental limits of safety-capability trade-off in LLM fine-tuning.
Fine-tuning harms in-context learning, but restricting updates to the value matrix improves zero-shot performance.
problem Fine-tuning harms in-context learning, reducing zero-shot performance on unseen tasks.
method Theoretical analysis of linear attention models, identifying conditions for degraded few-shot performance.
result Restricting updates to the value matrix improves zero-shot performance while preserving in-context learning.
SpotTune adapts fine-tuning strategies per instance for improved transfer learning.
problem Improving transfer learning performance with deep neural networks.
method Adaptive fine-tuning approach using policy networks to decide whether to use pre-trained or fine-tuned layers.
result SpotTune outperforms traditional fine-tuning on 12 out of 14 standard datasets and achieves highest scores on Visual Decathlon.
Measures consistency of tabular LLM predictions under fine-tuning multiplicity.
problem Conflicting predictions from fine-tuned tabular LLMs.
method Local stability measure in embedding space.
result Probabilistic guarantees on prediction consistency under multiplicity.
Self-play fine-tuning improves diffusion models for text-to-image generation.
problem Plateauing performance of diffusion models after data saturation.
method Self-play fine-tuning (SPIN-Diffusion) using competition among model versions.
result Significantly improved model performance and human preference alignment.
The paper develops a theory linking pretraining and fine-tuning in neural networks.
problem Understanding how initialization choices impact feature learning and generalization in neural networks.
method Analytical theory of diagonal linear networks, deriving generalization error as a function of initialization parameters and task statistics.
result Different initialization choices place networks into four fine-tuning regimes with varying abilities to support feature learning and generalization.
Automorphisms of fine 1-curve graph linked to surface homeomorphisms.
problem Understanding automorphisms of fine 1-curve graphs.
method Isomorphic mapping to surface homeomorphisms.
result Automorphism group is isomorphic to homeomorphism group of a surface.
New method reduces fine-tuning cost for reused models.
problem Repeating fine-tuning costs with outdated foundation models.
method Portable Reward Tuning (PRT) trains a reward model to maximize the same loss function as fine-tuning.
result PRT achieves comparable accuracy to inference-time tuning with less inference cost.
Compact models match or exceed GPT's performance in financial news sentiment analysis.
problem Improving financial sentiment analysis models without large computational costs.
method Fine-tuning non-generative, small-sized models (FinBERT, FinDRoBERTa) on a novel market score database.
result Fine-tuned models outperform GPT-3.5 and GPT-4 in zero-shot learning for financial news sentiment analysis.
Automorphisms of fine graphs for surfaces and tori are studied.
problem Understanding automorphisms of fine graphs for surfaces and tori.
method Extending previous results to tori and discussing smooth versions.
result Automorphism groups of fine graphs for surfaces and tori are naturally isomorphic to homeomorphism groups.
Fine-tuning large language models requires minimal data, making them efficient.
problem Achieving state-of-the-art performance with large language models.
method Using BERT as an example, fine-tuning only the most critical layers of the pre-trained model.
result Fine-tuned models are close in parameter space to the pre-trained model, with many good solutions found in sparsified versions.
Unsupervised pre-training improves model generalization, but lacks theoretical understanding.
problem Lack of theoretical understanding of unsupervised pre-training's impact on model generalization.
method Introduces a novel theoretical framework to analyze and enhance generalization.
result Enhances understanding of unsupervised pre-training and fine-tuning, proposing a new regularization method.
LP-FT improves personalized model training in FL by balancing generalization and personalization.
problem Federated Learning struggles with balancing global generalization and local personalization due to non-identical data distributions.
method Adapting Linear Probing followed by full Fine-Tuning (LP-FT) to the FL setting.
result LP-FT outperforms standard fine-tuning in balancing personalization and generalization across various datasets and PFT variants.
UBM transfers bias mitigation from upstream to downstream tasks efficiently.
problem Bias in fine-tuned language models across various tasks.
method Apply bias mitigation to an upstream model, then fine-tune a downstream model on this mitigated model.
result UBM effects transfer to new downstream tasks, creating less biased models.
Improved fine-tuning with regularization and robustness for noisy labels.
problem Fine-tuning pre-trained models on small datasets can lead to overfitting and memorization.
method PAC-Bayes generalization bound analysis, layer-wise regularization, self-label-correction, label-reweighting.
result Improves performance by 1.76% on average for image classification tasks and 0.75% for few-shot classification.
Fine shape of local compacta represented by ordinary maps.
problem Representing fine shape of local compacta.
method Constructing a space ∣X∣ for each local compactum X such that fine shape classes correspond to homotopy classes of maps to ∣X∣. result Fine shape classes from any locally compact metrizable space Y to X bijectively correspond to homotopy classes of maps from Y to ∣X∣.