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

Trend · papers per month

3978117156 · Jun 202019922001200920172026
48 results for tall buildings

Machine learning reduces wind tunnel testing costs for tall buildings.

problem Limited wind tunnel tests fail to fully reveal interference effects of tall buildings.
method Used machine learning techniques, including GANs, to predict pressure coefficients.
result GANs model based on 30% of dataset accurately predicts pressure coefficients under unseen conditions.

Tall wheatgrass outperforms rye in energy and environmental metrics, marginally improving economic viability.

problem Finding sustainable alternatives for marginal agricultural areas.
method Economic assessment using profit margin and Life Cycle Assessment (LCA) for energy and environmental performance.
result Tall wheatgrass shows better environmental and energy performance with reduced inputs and lower energy consumption.

Kähler complexity one Hamiltonian T-manifolds have trivial paintings.

problem Understanding the structure of Kähler complexity one Hamiltonian T-manifolds.
method Proving the existence of a trivial painting for compact, connected Kähler complexity one Hamiltonian T-manifolds.
result Every compact, connected Kähler complexity one Hamiltonian T-manifold has a trivial painting.

This paper describes a distributed MapReduce implementation of the minimum Redundancy Maximum Relevance algorithm, a popular feature selection method in bioinformatics and network inference problems. The proposed approach handles both tall/narrow and wide/short datasets. We further provide an open source implementation…

2017-09-07abs ↗pdf ↗

Markov chain Monte Carlo methods are often deemed too computationally intensive to be of any practical use for big data applications, and in particular for inference on datasets containing a large number nn of individual data points, also known as tall datasets. In scenarios where data are assumed independent, various…

2015-05-11abs ↗pdf ↗

R package spca computes sparse principal components efficiently.

problem Sparse principal components analysis (SPCA) for interpretable data.
method Least squares sparse principal component analysis (LS-SPCA) with efficient C++ backend.
result Computes sparse principal components that maximize variance and maintain strong correlations with PCs.

ECD algorithm speeds up non-convex optimization, offering quantum and stochastic enhancements.

problem Non-convex optimization challenges in machine learning.
method Energy Conserving Descent (ECD) algorithm, stochastic ECD dynamics (sECD), quantum ECD Hamiltonian (qECD).
result ECD and its quantum version achieve exponential speedup over gradient descent.

The paper proposes methods to estimate MCMC quality with couplings, bounding Wasserstein distance.

problem Improving MCMC efficiency without sacrificing asymptotic consistency.
method Estimators based on couplings of Markov chains to assess quality of asymptotically biased sampling methods.
result Empirical upper bounds of Wasserstein distance for assessing MCMC quality.

Nonnegative matrix factorization (NMF) has an established reputation as a useful data analysis technique in numerous applications. However, its usage in practical situations is undergoing challenges in recent years. The fundamental factor to this is the increasingly growing size of the datasets available and needed in …

2015-05-18abs ↗pdf ↗

SMI uses mixture models to improve SVGD's performance in Bayesian inference.

problem Variance collapse in SVGD for Bayesian inference, especially with small models.
method Generalizes SVGD to Stein mixture models, optimizing an ELBO lower bound.
result SMI avoids variance collapse and accurately estimates uncertainty for small BNNs.

New MCMC methods use auxiliary variables to sample from intractable distributions.

problem Sampling from distributions with unknown normalizing constants.
method Unified Markov chain Monte Carlo framework with auxiliary variables.
result New algorithms outperform existing methods on synthetic and real datasets.

Random sampling has become a critical tool in solving massive matrix problems. For linear regression, a small, manageable set of data rows can be randomly selected to approximate a tall, skinny data matrix, improving processing time significantly. For theoretical performance guarantees, each row must be sampled with pr…

2014-08-21abs ↗pdf ↗

Builds geometric structures for algebraic groups over real closed fields.

problem Characterizing and decomposing algebraic groups over specific valued fields.
method Real algebraic geometry to construct and analyze affine buildings.
result Computed stabilizers and obtained group decompositions.

Study Poisson boundaries of building lattices and generalize rigidity results.

problem Understanding Poisson boundaries of building lattices and their rigidity properties.
method Proved Poisson boundaries and used them to generalize rigidity results.
result Generalized rigidity results for morphisms and cocycles from lattices in buildings to groups with negative curvature.

We show that if a homeomorphism between the ideal boundaries of two Fuchsian buildings preserves the combinatorial cross ratio almost everywhere, then it extends to an isomorphism between the Fuchsian buildings. It follows that Mostow rigidity holds for Fuchsian buildings: if a group acts properly and cocompactly on tw…

2004-07-23abs ↗pdf ↗

We describe some buildings related to complex Kac-Moody groups. First we describe the spherical building of SLn(C) (i.e. the projective geometry PG(Cn)) and its Veronese representation. Next we recall the construction of the affine building associated to a discrete valuation on the rational function field C(z)C(z). Then …

2001-09-19abs ↗pdf ↗

Research proves limits on harmonic map orders into Euclidean buildings.

problem Limits on the possible orders of harmonic maps from surfaces to Euclidean buildings.
method Direct analysis of homogeneous maps and related spherical billiards problem.
result The order of harmonic maps is of the form mk\frac mk where kk divides W|W|.

The n-solvable filtration {Fn}n=0\{\mathcal{F}_n\}_{n=0}^\infty of the smooth knot concordance group (denoted by C\mathcal{C}), due to Cochran-Orr-Teichner, has been instrumental in the study of knot concordance in recent years. Part of its significance is due to the fact that certain geometric characterizations of a knot …

2013-09-29abs ↗pdf ↗

Harmonic maps to Euclidean buildings have rectifiable singular strata.

problem Understanding the structure of singular points for harmonic maps.
method Defining singular strata and proving rectifiability using the rectifiable Reifenberg program.
result Rectifiability of singular strata for harmonic maps into FF-connected complexes.

Automates building structural design with reduced mass and carbon footprint.

problem Time-consuming and laborious manual design process for buildings.
method Formulated building structures as graphs, trained end-to-end pipeline with a differentiable simulator.
result Optimal structural designs comparable to GA, with reduced building mass and carbon footprint.

This paper constructs and proves the uniqueness of pluriharmonic maps to Euclidean buildings.

problem Existence and uniqueness of pluriharmonic maps to Euclidean buildings.
method Constructs a ρ-equivariant pluriharmonic map with specific asymptotic behavior and proves its uniqueness.
result Uniqueness of pluriharmonic maps to Euclidean buildings.

Machine learning detects building damage in satellite images.

problem Extracting damage information from satellite imagery is slow and labor-intensive.
method Used four convolutional neural network models to detect damaged buildings.
result Models performed well in detecting damaged buildings in the 2010 Haiti earthquake.

We introduce a construction turning some Coxeter and Davis realizations of buildings into systolic complexes. Consequently groups acting geometrically on buildings of triangle types distinct from (2,4,4)(2,4,4), (2,4,5)(2,4,5), (2,5,5)(2,5,5), and various rank 44 types are systolic.

2013-10-21abs ↗pdf ↗

A new method reduces the bias in estimating inverse covariance matrices from sketches.

problem Reducing the bias in estimating inverse covariance matrices from sketches.
method Developed a framework for analyzing inversion bias and proposed a new sketching technique called LEverage Score Sparsified (LESS) embeddings.
result The new sketching technique reduces the inversion bias to O(1/d)O(1/\sqrt d) for m=O(d)m=O(d), significantly smaller than the Θ(1)Θ(1) approximation error.

In this paper we introduce, for each closed orientable surface, an analogue of Tits buildings adjusted to investigation of the Torelli group of this surface. It is a simplicial complex with some additional structure. We call this complex with its additional structure the Torelli building of the surface in question. The…

2014-10-23abs ↗pdf ↗

In this article, we discuss the quasiconformal structure of boundaries of right-angled hyperbolic buildings using combinatorial tools. In particular we exhibit some examples of buildings of dimension 3 and 4 whose boundaries satisfy the combinatorial Loewner property. This property is a weak version of the Loewner prop…

2014-11-13abs ↗pdf ↗

Modeling buildings' heat dynamics is a complex process which depends on various factors including weather, building thermal capacity, insulation preservation, and residents' behavior. Gray-box models offer a causal inference of those dynamics expressed in few parameters specific to built environments. These parameters …

2019-01-09abs ↗pdf ↗