Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

2925838751,166 · Jun 202019922001200920172026
48 results for evolving domain generalization

SYNC learns time-aware causal representations to improve model generalization in evolving domains.

problem Spurious correlations and shortcut learning in existing EDG methods hinder model generalization.
method SYNC integrates dynamic causal factors and causal mechanism drifts into a sequential VAE framework.
result SYNC achieves superior temporal generalization performance on synthetic and real-world datasets.

Most transport theorems---that is, a formula for the rate of change of an integral in which both the integrand and domain of integration depend on time---involve domains that evolve according to a flow map. Such domains are said to be convecting. Here a transport theorem for nonconvecting domains evolving on an embedde…

2018-08-24abs ↗pdf ↗

Paper tackles continuous transfer learning with evolving target domains.

problem Challenges of negative transfer in evolving target domains.
method Proposes label-informed C-divergence for measuring distribution shift and negative transfer.
result Demonstrates effectiveness of TransLATE framework in minimizing classification error and C-divergence.

We investigate the evolution of open curves with fixed endpoints under the curve shortening flow, which evolves curves in proportion to their curvature. Using a distance comparison of Huisken, we determine the long-term behavior of open curves with fixed endpoints evolving in certain convex domains on surfaces of const…

2012-08-16abs ↗pdf ↗

In this article, we introduce a new type of mean curvature flow for bounded star-shaped domains in space forms and prove its longtime existence, exponential convergence without any curvature assumption. Along this flow, the enclosed volume is a constant and the surface area evolves monotonically. Moreover, for a bounde…

2013-09-19abs ↗pdf ↗

We study the curvature flow of planar nonconvex lens-shaped domains, considered as special symmetric networks with two triple junctions. We show that the evolving domain becomes convex in finite time; then it shrinks homothetically to a point. Our theorem is the analog of the result of Grayson for curvature flow of clo…

2009-05-31abs ↗pdf ↗

We consider convex symmetric lens-shaped networks in R^2 that evolve under curve shortening flow. We show that the enclosed convex domain shrinks to a point in finite time. Furthermore, after appropriate rescaling the evolving networks converge to a self-similarly shrinking network, which we prove to be unique in an ap…

2007-11-07abs ↗pdf ↗

The paper studies minimal surface flow and translating solitons, proving global solutions and convergence.

problem Finding global solutions and convergence of minimal surface flow and translating solitons.
method Evolved surfaces over convex planar domains evolving by minimal surface flow, proving a priori estimates for translating solitons.
result Global solutions of minimal surface flow converge to translating solitons under suitable conditions.

This paper tackles continuous domain generalization, improving model performance across unseen domains.

problem Existing domain generalization approaches fail to capture the complex, multidimensional nature of real-world variation.
method Introduces Continuous Domain Generalization (CDG), a principled framework grounded in geometric and algebraic theories. Proposes a Neural Lie Transport Operator (NeuralLio) for structure-preserving parameter transitions and a gating mechanism for robust generalization.
result Demonstrates significant improvement in generalization accuracy and robustness across various datasets.

Smooth solutions up to evolving free boundaries for degenerate equations.

problem Degenerate parabolic equations with evolving free boundaries.
method Smooth short-time existence using linear degenerate equations on a fixed domain.
result Smoothness up to the free boundary for the pp-Laplacian evolution equation and αα-Gauss curvature flow.

KOMET identifies Koopman operators from model parameter trajectories to adapt to evolving data distributions.

problem Adaptation of parametric models to non-stationary environments.
method Data-driven framework using Koopman operator identification and Extended Dynamic Mode Decomposition (EDMD).
result KOMET achieves high autonomous-rollout accuracies of 0.981 to 1.000 over 100 time steps on various drifting datasets.

The Teichmüller harmonic map flow, introduced in [9], evolves both a map from a closed Riemann surface to an arbitrary compact Riemannian manifold, and a constant curvature metric on the domain, in order to reduce its harmonic map energy as quickly as possible. In this paper, we develop the geometric analysis of holomo…

2012-09-17abs ↗pdf ↗

Transferring knowledge across many streaming processes remains an uncharted territory in the existing literature and features unique characteristics: no labelled instance of the target domain, covariate shift of source and target domain, different period of drifts in the source and target domains. Autonomous transfer l…

2019-10-08abs ↗pdf ↗

This paper uses LLMs to streamline industrial data-centric R&D cycles.

problem High costs in human, computational, and time resources in data-centric R&D.
method Explores how large language models can understand domain-specific requirements and automate R&D tasks.
result Promising results show potential for automating industrial data-centric R&D cycles.

Method predicts how probability distributions evolve over time.

problem Predicting how systems described by probability distributions evolve under different conditions.
method Wasserstein Parallel Transport
result Wasserstein Parallel Transport provides counterfactual comparisons of distributional dynamics.

Evolutionary algorithm finds optimal pixel perturbations to improve neural network generalization.

problem Minimal data corruption by pixel modifications causes overfitting in neural networks.
method Evolutionary algorithm with a novel cost function to maximize generalization gap and domain divergence.
result Method outperforms previous pixel-based data distribution shift methods on CNNs.

In this note we prove that the level-set flow of the topologist's sine curve is a smooth closed curve. In previous work it was shown by the second author that under level-set flow, a locally-connected set in the plane evolves to be smooth, either as a curve or as a positive area region bounded by smooth curves. Here we…

2016-01-11abs ↗pdf ↗

DynamicGEM is an open-source Python library for learning node representations of dynamic graphs. It consists of state-of-the-art algorithms for defining embeddings of nodes whose connections evolve over time. The library also contains the evaluation framework for four downstream tasks on the network: graph reconstructi…

2018-11-26abs ↗pdf ↗

FactorMiner discovers financial alpha factors with low redundancy.

problem Finding novel financial alpha factors in a vast search space.
method Modular Skill Architecture and Experience Memory to distill and guide exploration.
result FactorMiner constructs a diverse library of high-quality factors with competitive performance.

Network representation learning in low dimensional vector space has attracted considerable attention in both academic and industrial domains. Most real-world networks are dynamic with addition/deletion of nodes and edges. The existing graph embedding methods are designed for static networks and they cannot capture evol…

2018-12-06abs ↗pdf ↗

Self-training improves gradual domain adaptation with unlabeled data.

problem Improving machine learning models' adaptability to gradually shifting data distributions.
method Proved upper bounds on self-training error, highlighted the importance of regularization and label sharpening, and demonstrated algorithmic insights.
result Self-training works well for gradual shifts, especially with small Wasserstein-infinity distance.

The concept of a conformal deformation has two natural extensions: quasiconformal and harmonic mappings. Both classes do not preserve the conformal type of the domain, however they cannot change it in an arbitrary way. Doubly connected domains are where one first observes nontrivial conformal invariants. Herbert Groetz…

2009-12-17abs ↗pdf ↗

Graph representation learning resurges as a trending research subject owing to the widespread use of deep learning for Euclidean data, which inspire various creative designs of neural networks in the non-Euclidean domain, particularly graphs. With the success of these graph neural networks (GNN) in the static setting, …

2019-02-26abs ↗pdf ↗

This letter extends the concept of graph-frequency to graph signals that evolve with time. Our goal is to generalize and, in fact, unify the familiar concepts from time- and graph-frequency analysis. To this end, we study a joint temporal and graph Fourier transform (JFT) and demonstrate its attractive properties. We b…

2016-02-14abs ↗pdf ↗

Increasingly, Internet of Things (IoT) domains, such as sensor networks, smart cities, and social networks, generate vast amounts of data. Such data are not only unbounded and rapidly evolving. Rather, the content thereof dynamically evolves over time, often in unforeseen ways. These variations are due to so-called con…

2017-10-05abs ↗pdf ↗

New boundary condition for weak inverse mean curvature flow in bounded domains.

problem Addressing the well-posedness of inverse mean curvature flow in bounded domains with an outer obstacle.
method Developed a new boundary condition, combined techniques including elliptic regularization, blow-up analysis, and parabolic estimates.
result Existence and uniqueness theorem for weak solutions in smooth bounded domains, with C1,αC^{1,α} regularity of level sets up to the obstacle.

In this paper we study the Teichmüller harmonic map flow as introduced by Rupflin and Topping [15]. It evolves pairs of maps and metrics (u,g)(u,g) into branched minimal immersions, or equivalently into weakly conformal harmonic maps, where uu maps from a fixed closed surface MM with metric gg to a general target manif…

2017-11-24abs ↗pdf ↗

AlphaSharpe uses LLMs to improve financial metrics robustness and predictive power.

problem Traditional financial metrics struggle with robustness and generalization in volatile markets.
method Iterative optimization of financial metrics using LLMs, including crossover, mutation, and evaluation.
result AlphaSharpe discovers enhanced risk-return metrics with 3x predictive power and 2x portfolio performance.

In this work, we study graphs in $\M^n\times\Real$ that are evolving by the mean curvature flow over a bounded domain on $\M^n$, with prescribed contact angle in the boundary. We prove that solutions converge to translating surfaces in $\M^n\times\Real$. Also, for a Riemannian manifold $\M^2$ with negative Gaussian cur…

2011-09-26abs ↗pdf ↗

Partially performative prediction studies how predictive models influence future data.

problem Distribution shift in predictive models due to endogenous and exogenous factors.
method Generalizing performative prediction to capture both endogenous and exogenous sources of distribution shift.
result Developed online analogues of performative stability and optimality for partially performative environments.

We present a set of high-probability inequalities that control the concentration of weighted averages of multiple (possibly uncountably many) simultaneously evolving and interdependent martingales. Our results extend the PAC-Bayesian analysis in learning theory from the i.i.d. setting to martingales opening the way for…

2011-10-31abs ↗pdf ↗