arXiv research

Researchers solved a model of an exhaustible resource with stochastic discoveries.

State-of-the-art image recognition systems use sophisticated Convolutional Neural Networks (CNNs) that are designed and trained to identify numerous object classes. Such networks are fairly resource intensive to compute, prohibiting their deployment on resource-constrained embedded platforms. On one hand, the ability t…

Deep RL for uncoordinated cognitive radios finds near-optimal policies.

Pattern sampling reduces time series classification complexity.

This paper improves image super-resolution by integrating cross-scale non-local attention.

Adaptive RL optimizes testing resource allocation for dynamic software environments.

HATCH learns optimal recommendations with resource constraints.

We propose the time-dependent generalization of an `ordinary' autonomous human biomechanics, in which total mechanical + biochemical energy is not conserved. We introduce a general framework for time-dependent biomechanics in terms of jet manifolds derived from the extended musculo-skeletal configuration manifold. The …

Deep imagination optimizes decision-making in large trees with limited resources.

Most digital cameras use sensors coated with a Color Filter Array (CFA) to capture channel components at every pixel location, resulting in a mosaic image that does not contain pixel values in all channels. Current research on reconstructing these missing channels, also known as demosaicing, introduces many artifacts, …

Interference among concurrent transmissions in a wireless network is a key factor limiting the system performance. One way to alleviate this problem is to manage the radio resources in order to maximize either the average or the worst-case performance. However, joint consideration of both metrics is often neglected as …

POCAII optimizes hyperparameters with a new approach, showing superior performance.

RL enhances cloud autoscaling by learning optimal resource allocation.

Identifying the unknown underlying trend of a given noisy signal is extremely useful for a wide range of applications. The number of potential trends might be exponential, which can be computationally exhaustive even for short signals. Another challenge, is the presence of abrupt changes and outliers at unknown times w…

Our goal is to design architectures that retain the groundbreaking performance of CNNs for landmark localization and at the same time are lightweight, compact and suitable for applications with limited computational resources. To this end, we make the following contributions: (a) we are the first to study the effect of…

This paper exhausts curve complexes on non-orientable surfaces.

The paper develops a scalable method to infer GRNs from sparse data.

Probabilistic model for exhaustion in infinite-genus curve complexes.

grangersearch tests causal relationships in time series data.

Let $N$ be a compact, connected, nonorientable surface of genus $g$ with $n$ boundary components. Let $\mathcal{C}(N)$ be the curve complex of $N$. We prove that if $(g,n) = (3,0)$ or $g + n \geq 5$, then there is an exhaustion of $\mathcal{C}(N)$ by a sequence of finite rigid sets. This improves the author's result on…

Let $S$ be a connected orientable surface of finite topological type. We prove that there is an exhaustion of the curve complex $\mathcal{C}(S)$ by a sequence of finite rigid sets.

We propose a K-sparse exhaustive search (ES-K) method and a K-sparse approximate exhaustive search method (AES-K) for selecting variables in linear regression. With these methods, K-sparse combinations of variables are tested exhaustively assuming that the optimal combination of explanatory variables is K-sparse. By co…

Bounded rationality, that is, decision-making and planning under resource limitations, is widely regarded as an important open problem in artificial intelligence, reinforcement learning, computational neuroscience and economics. This paper offers a consolidated presentation of a theory of bounded rationality based on i…

In this note, we prove an existence result on exhaustion functions adapting the method by L.-F. Tam. Then we apply it to prove short-time existence of Ricci flow and study Yau's uniformization conjecture using similar method as Fei He and Lee-Tam.

Machine learning plays an increasing role in intelligent tutoring systems as both the amount of data available and specialization among students grow. Nowadays, these systems are frequently deployed on mobile applications. Users on such mobile education platforms are dynamic, frequently being added, accessing the appli…

We prove that if a smoothly bounded strongly pseudoconvex domain $D \subset \mathbb C^n$, $n \geq 2$, admits at least one Monge-Ampère exhaustion smooth up to the boundary (i.e. a plurisubharmonic exhaustion $τ: \overline D \to [0,1]$, which is $\mathcal C^\infty$ at all points except possibly at the unique minimum poi…

Let $N$ be a compact, connected, nonorientable surface of genus $g$ with $n$ boundary components. Let $\mathcal{C}(N)$ be the curve complex of $N$. We prove that if $(g, n) \neq (1,2)$ and $g + n \neq 4$, then there is an exhaustion of $\mathcal{C}(N)$ by a sequence of finite superrigid sets.

The paper explores uniform perfectness and centers in Morse boundaries.

State-of-the-art named entity recognition (NER) systems have been improving continuously using neural architectures over the past several years. However, many tasks including NER require large sets of annotated data to achieve such performance. In particular, we focus on NER from clinical notes, which is one of the mos…

Proposes a taxonomy for economic policies.

The paper studies Kähler metrics from finite Monge-Ampère mass exhaustion functions.

We consider three fundamental classes of compact almost homogeneous manifolds and show that the complements of singular complex orbits in such manifolds are endowed with plurisubharmonic exhaustions satisfying complex homogeneous Monge-Ampère equations. This extends to a new family of mixed type examples various classi…

Regularity properties of intrinsic objects for a large class of Stein Manifolds, namely of Monge-Ampère exhaustions and Kobayashi distance, is interpreted in terms of modular data. The results lead to a construction of an infinite dimensional family of convex domains with squared Kobayashi distance of prescribed regula…

In this paper, aimed at exploring the fundamental properties of isoperimetric region in $3$-manifold $(M^3,g)$ which is asymptotic to Anti-de Sitter-Schwarzschild manifold with scalar curvature $R\geq -6$, we prove that connected isoperimetric region $\{D_i\}$ with $\mathcal{H}_g ^3(D_i)\geq δ_0>0$ cannot slide off to …

By a theorem of Greene and Wu, a noncompact connected Riemannian manifold admits a smooth strictly subharmonic exhaustion function. Demailly provided an elementary proof of this fact. A further simplification of Demailly's proof and some (mostly known) applications are described. Applications include the fact that the …

FLoE adapts LLMs by selectively deploying LoRA adapters based on layer importance and task requirements.

Paper proposes using pairwise feature comparisons to infer modification costs for user recourse.

For an orientable surface $S$ of finite topological type with genus $g \geq 3$, we construct a finite set of curves whose union of iterated rigid expansions is the curve graph of $S$. The set constructed, and the method of rigid expansion, are closely related to Aramayona and Leiniger's finite rigid set, and in fact a …

Non-exhaustive learning (NEL) is an emerging machine-learning paradigm designed to confront the challenge of non-stationary environments characterized by anon-exhaustive training sets lacking full information about the available classes.Unlike traditional supervised learning that relies on fixed models, NEL utilizes se…

In this paper, we prove that the L^2 Betti numbers of an amenable covering space can be approximated by the average Betti numbers of a regular exhaustion, under some hypotheses. We also prove that some L^2 spectral invariants can be approximated by the corresponding average spectral invariants of a regular exhaustion. …

Generalizes Nakano-positivity to Hilbert space fields.

A compact real analytic Riemannian manifold M admits a canonical complexification with plurisubharmonic exhaustion function satisfying the homogeneous complex Monge-Ampere equation, called a Grauert tube. From the point of view of complex analysis, several authors have considered whether a given complex manifold can ar…

A finitely presented group is weakly geometrically simply connected (wgsc) if it is the fundamental group of some compact polyhedron whose universal covering is wgsc i.e. it has an exhaustion by compact connected and simply connected sub-polyhedra. We show that this condition is almost-equivalent to Brick's qsf propert…

Constructs uniformly positive scalar curvature metrics on open manifolds

New research shows IBM's GDX algorithm outperforms Vytelingum's Adaptive-Aggressive strategy in market simulations.

In this paper we study the Sasakian geometry on S^3-bundles over a Riemann surface of genus g>0 with emphasis on extremal Sasaki metrics. We prove the existence of a countably infinite number of inequivalent contact structures on the total space of such bundles that admit 2-dimensional Sasaki cones each with a Sasaki m…

We generalize A. Borbély's condition for the conclusion of the Omori-Yau maximum principle for the Laplace operator on a complete Riemannian manifold to a second-order linear semi-elliptic operator $L$ with bounded coefficients and no zeroth order term. Also, we consider a new sufficient condition for the existence of …

Following a purely algebraic procedure, we provide an exhaustive classification of local Weyl-invariant scalar densities in dimension D=8.