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,657 papers · 148 categories

Trend · papers per month

53106158211 · May 202619922001200920172026
48 results for avoidance principle

The paper extends the avoidance principle for mean curvature flows, proving new intersection dimension monotonicity results.

problem Understanding the behavior of intersections in mean curvature flows.
method Proving new intersection dimension monotonicity results for mean curvature flows, Brakke flows, and level set flows.
result The dimension of the intersection of mean curvature flows is non-increasing over time.

Study on curve shortening flow in 3D space curves, showing convexity preservation and avoidance principle.

problem Analyzing the behavior of space curves under curve shortening flow in R3\mathbb{R}^3.
method Analysis of properties of space curves evolved by the curve shortening flow, including convexity preservation and avoidance principle.
result Orthogonal projections of space curves remain convex, and the Avoidance principle is shown for spherical curves.

Study stabilizes translating solitons in hyperbolic space for MCF.

problem Stability of translating solitons in hyperbolic space.
method Developed theory, constructed rotationally invariant translators, used avoidance principle and maximum principle.
result Horospheres are dynamically stable as radial graphical solutions to MCF.

The paper establishes principles for initializing and designing GNNs with ReLU activations to avoid oversmoothing and correlation collapse.

problem Oversmoothing and correlation collapse in deep ReLU GNNs.
method The paper derives and validates three principles for initialization and architecture selection in finite width graph neural networks with ReLU activations.
result Correct initialization, residual aggregation operators, and residual connections significantly improve early training dynamics in deep ReLU GNNs.

We study flows of hypersurfaces in Riemannian manifolds with specific curvature speeds.

problem Understanding the evolution of hypersurfaces in Riemannian manifolds under Weingarten conditions.
method Investigating Weingarten flows with a Weingarten function that is homogeneous, monotonic, and positive.
result Existence and embedding preserving properties of Weingarten flows with isoparametric initial data.

Avoids noncompact hypersurfaces from touching in evolving flows.

problem Preventing noncompact hypersurfaces from touching in evolving flows.
method Analyzes mean curvature flow and weak set flows in Euclidean and Riemannian spaces.
result Proves that noncompact hypersurfaces remain disjoint in evolving flows.

Paper refutes EM convergence theory and introduces a new EM algorithm.

problem The convergence theory of the EM algorithm is incorrect and affects its performance.
method Proposes a new EM algorithm called the Channel Matching (CM) EM algorithm and provides an initialization map.
result The locally maximal Q can affect the convergent speed but not the global convergence.

The paper extends physics-based information maximization to complex bandit problems.

problem Designing efficient decision-making policies for complex bandit problems.
method Information and free-energy maximization principles adapted to three distinct bandit types.
result Information maximization leads to strong performance in complex bandit problems.

We provide a dynamic programming principle for stochastic optimal control problems with expectation constraints. A weak formulation, using test functions and a probabilistic relaxation of the constraint, avoids restrictions related to a measurable selection but still implies the Hamilton-Jacobi-Bellman equation in the …

2011-05-04abs ↗pdf ↗

New causal versions of MaxEnt and PIR avoid paradoxical probability updates.

problem Paradoxical probability updates in causal MaxEnt and PIR.
method Separate constraints into cause-specific and mechanism-specific restrictions.
result Causal MaxEnt avoids paradoxical updates and aligns with Information Geometric Causal Inference.

A new method avoids overfitting in network reconstruction by using the minimum description length principle.

problem Determining the optimal model complexity in network reconstruction to prevent overfitting.
method Hierarchical Bayesian inference and weight quantization based on the minimum description length principle.
result The method yields increased accuracy in reconstructing both artificial and empirical networks.

We address the problem of {\it adaptivity} in the framework of reproducing kernel Hilbert space (RKHS) regression. More precisely, we analyze estimators arising from a linear regularization scheme $g_\lam$. In practical applications, an important task is to choose the regularization parameter $\lam$ appropriately, i.e.…

2018-04-15abs ↗pdf ↗

Neural networks with binary weights are computation-efficient and hardware-friendly, but their training is challenging because it involves a discrete optimization problem. Surprisingly, ignoring the discrete nature of the problem and using gradient-based methods, such as the Straight-Through Estimator, still works well…

2020-02-25abs ↗pdf ↗

Study shows Brakke flow's non-triviality for smooth boundaries in codimension 1.

problem Understanding Brakke flow's non-triviality for smooth boundaries in codimension 1.
method Analyzing spacetime Brakke flow constructed by Buet et al. for initial varifolds.
result Support of mass measure of spacetime Brakke flow coincides with classical mean curvature flow's support.

Dynamic abstention improves LLM accuracy by selectively terminating unpromising reasoning.

problem LLMs waste compute on incorrect responses, leading to inefficiency.
method Formal reinforcement learning framework with abstention reward parameter.
result Dynamic abstention outperforms natural baselines in selective accuracy.

Bayesian Scattering offers a simple baseline for image data uncertainty.

problem Lack of interpretable, mathematically grounded uncertainty quantification methods for image data.
method Coupling wavelet scattering transform with a simple probabilistic head.
result Bayesian Scattering provides sensible uncertainty estimates under distribution shifts.

Operational risk is the risk relative to monetary losses caused by failures of bank internal processes due to heterogeneous causes. A dynamical model including both spontaneous generation of losses and generation via interactions between different processes is presented; the efforts made by the bank to avoid the occurr…

2012-07-26abs ↗pdf ↗

The continuous dynamical system approach to deep learning is explored in order to devise alternative frameworks for training algorithms. Training is recast as a control problem and this allows us to formulate necessary optimality conditions in continuous time using the Pontryagin's maximum principle (PMP). A modificati…

2017-10-26abs ↗pdf ↗

Many proteoforms - arising from alternative splicing, post-translational modifications (PTMs), or paralogous genes - have distinct biological functions, such as histone PTM proteoforms. However, their quantification by existing bottom-up mass-spectrometry (MS) methods is undermined by peptide-specific biases. To avoid …

2017-08-05abs ↗pdf ↗

This is the author's Master's thesis written under the supervision of Dr. Gregor Weingart at the National Autonomous University of Mexico. The purpose of this study is to rewrite differential supergeometry in terms of classical differential geometry. This rewriting from "first principles" has two main motivations: 1 av…

2014-10-29abs ↗pdf ↗

We investigate a statistical-static hedging technique for pricing assets considered as single-step stochastic cash flows. The valuation is based on constructing in a canonical way a European style derivative on a benchmark security such that the physical payoff distribution coincides with the (corrected) physical asset…

2013-12-16abs ↗pdf ↗

We solve the problem of optimal stopping of a Brownian motion subject to the constraint that the stopping time's distribution is a given measure consisting of finitely-many atoms. In particular, we show that this problem can be converted to a finite sequence of state-constrained optimal control problems with additional…

2016-04-11abs ↗pdf ↗

Probabilistic Latent Semantic Analysis is a novel statistical technique for the analysis of two-mode and co-occurrence data, which has applications in information retrieval and filtering, natural language processing, machine learning from text, and in related areas. Compared to standard Latent Semantic Analysis which s…

2013-01-23abs ↗pdf ↗

Developing classification methods with high accuracy that also avoid unfair treatment of different groups has become increasingly important for data-driven decision making in social applications. Many existing methods enforce fairness constraints on a selected classifier (e.g., logistic regression) by directly forming …

2019-03-10abs ↗pdf ↗

Estimation in generalized linear models (GLM) is complicated by the presence of constraints. One can handle constraints by maximizing a penalized log-likelihood. Penalties such as the lasso are effective in high dimensions, but often lead to unwanted shrinkage. This paper explores instead penalizing the squared distanc…

2017-11-03abs ↗pdf ↗

Improved vector quantization using Gaussian mixtures for better codebook utilization.

problem Training instability and information loss in discrete vector quantization.
method Generalized vector quantization with Gaussian mixture model and aggregated categorical posterior evidence lower bound.
result GM-VQ improves codebook utilization and reduces information loss without heuristics.

In this paper, we consider the interpretability of the foundational Laplacian-based semi-supervised learning approaches on graphs. We introduce a novel flow-based learning framework that subsumes the foundational approaches and additionally provides a detailed, transparent, and easily understood expression of the learn…

2017-09-14abs ↗pdf ↗

We introduce a framework to leverage knowledge acquired from a repository of (heterogeneous) supervised datasets to new unsupervised datasets. Our perspective avoids the subjectivity inherent in unsupervised learning by reducing it to supervised learning, and provides a principled way to evaluate unsupervised algorithm…

2017-09-14abs ↗pdf ↗

Actor-critic methods, a type of model-free Reinforcement Learning, have been successfully applied to challenging tasks in continuous control, often achieving state-of-the art performance. However, wide-scale adoption of these methods in real-world domains is made difficult by their poor sample efficiency. We address th…

2019-10-28abs ↗pdf ↗

Predictive state representations (PSRs) offer an expressive framework for modelling partially observable systems. By compactly representing systems as functions of observable quantities, the PSR learning approach avoids using local-minima prone expectation-maximization and instead employs a globally optimal moment-base…

2013-12-01abs ↗pdf ↗

Develops RL for dynamic risk assessment in stochastic optimization.

problem Time-consistent risk assessment in stochastic optimization problems.
method Model-free reinforcement learning with dynamic convex risk measures, time-consistent dynamic programming, policy gradient updates, actor-critic neural network optimization.
result Demonstrates optimal policies for statistical arbitrage, financial hedging, and robot control.