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.

169,291 papers · 148 categories

Trend · papers per month

6131925 · Oct 201919922001200920182026
48 results for concrete

Meta-learning approach improves CNN architectures for concrete defect classification.

problem Challenging task of recognizing defects in concrete infrastructure.
method Two reinforcement learning based meta-learning approaches (MetaQNN and NAS) for finding suitable CNN architectures.
result Learned architectures have fewer parameters and better multi-target accuracy.

Concrete autoencoder selects key features for efficient data reconstruction.

problem Efficiently identifying and selecting important features for data reconstruction.
method Concrete selector layer with temperature-controlled selection during training, followed by reconstruction using a standard neural network.
result Concrete autoencoder selects a small subset of genes that can reconstruct the remaining gene expression levels, improving on existing methods.

Concrete distribution relaxes discrete variables for gradient-based optimization.

problem Gradient-based optimization of discrete random variables.
method Concrete distribution as a continuous relaxation of discrete variables, enabling reparameterization and gradient computation.
result Concrete distribution allows for low-variance biased gradients in discrete stochastic nodes.

Paper proposes a holistic optimization for civil structures considering uncertainties.

problem Designing civil structures requires integration of material and structural design.
method Holistic optimization combining concrete mixture design and structural simulations.
result Inverted workflow allows consideration of new mixtures and uncertainties.

Proposes an accuracy-preserving calibration method for DNNs.

problem Calibration of deep neural networks (DNNs) to measure prediction reliability.
method Uses Concrete distribution on the probability simplex to calibrate DNNs without accuracy loss.
result The proposed method outperforms previous methods in accuracy-preserving calibration tasks.

We introduce non-acyclic PGLn(C)PGL_n(\mathbb{C})-torsion of a 3-manifold with toroidal boundary as an extension of J. Porti's PGL2(C)PGL_2(\mathbb{C})-torsion, and present an explicit formula of the PGLn(C)PGL_n(\mathbb{C})-torsion of a mapping torus for a surface with punctures, by using the higher Teichmüler theory due to V. Fock …

2013-10-11abs ↗pdf ↗

We define an extended Bloch group for an arbitrary field F, and show that this group is canonically isomorphic to K_3^ind(F) if F is a number field. This gives an explicit description of K_3^ind(F) in terms of generators and relations. We give a concrete formula for the regulator, and derive concrete symbol expressions…

2009-10-21abs ↗pdf ↗

A new method sparsifies neural networks using stochastic binary optimization.

problem Sparsifying neural networks to reduce computational cost and improve efficiency.
method Stochastic binary optimization with the Augment-Reinforce-Merge (ARM) estimator.
result ARM enables efficient network sparsification with comparable accuracy to baseline methods.

Improved CAEs reduce training time and enhance generalization.

problem Stability issues in Concrete Autoencoders (CAEs) for feature selection.
method Indirectly Parameterized Concrete Autoencoders (IP-CAEs) learn parameters of Gumbel-Softmax distributions.
result IP-CAEs achieve significant improvements in generalization and training time.

This is a short survey on finite-volume hyperbolic four-manifolds. We describe some general theorems and focus on the concrete examples that we found in the literature. The paper contains no new result.

2015-12-11abs ↗pdf ↗

Proposes a few-shot learning method for feature selection without labeled data.

problem Feature selection in unlabeled data with limited instances.
method Uses Concrete random variables and permutation-invariant neural networks to select features from multiple source tasks.
result Outperforms existing methods in feature selection performance.

Upper bounds on neural network complexity for PDE solutions.

problem Approximating solutions of parametric PDEs without knowing their exact form.
method Using low-dimensionality of solution manifolds and a small reduced basis.
result Neural networks can approximate PDE solutions with sizes dependent only on the reduced basis.

The paper describes Hermitian non-Kähler structures on complex flag manifolds.

problem Understanding Hermitian non-Kähler structures on products of principal S¹-bundles.
method Using representation theory of complex simple Lie algebras and Cartan-Ehresmann connections.
result Explicit description of Hermitian non-Kähler manifolds and families of complex structures.

New algorithm for non-Markovian optimal stopping problems using Brownian motion.

problem Optimal stopping time problems for non-Markovian state processes.
method Longstaff-Schwartz-type algorithm based on statistical learning theory.
result Error estimates for approximation architecture spaces with finite Vapnik-Chervonenkis dimension.

We continue the study of blow-ups in generalized complex geometry with the blow-up theory for generalized Kähler manifolds. The natural candidates for submanifolds to be blown-up are those which are generalized Poisson for one of the two generalized complex structures and can be blown up in a generalized complex manner…

2016-03-18abs ↗pdf ↗

This study assesses model influence on RL algorithm performance.

problem Unclear contribution of model-based RL algorithms to recent progress.
method Established a set of models for comparison, including NNs, BNNs, GPs, and ensembles.
result Concrete Dropout NN shows superior performance across benchmark tasks.

The Klein-Grifone approach to global Finsler geometry is adopted. The nullity distributions of the three curvature tensors of Cartan connection are investigated. Nullity distributions concerning certain relevant special Finsler spaces are considered. Concrete examples are given whenever the situation needs.

2012-10-31abs ↗pdf ↗

Switching linear dynamics improves model-based reinforcement learning and system identification.

problem Complex and nonlinear systems can be approximated by linear dynamical systems.
method Bayesian inference, Variational Autoencoders, Concrete relaxations.
result Improved accuracy in learning dynamics from partial and high-dimensional observations.

We give a topological and geometrical description of focus-focus singularities of integrable Hamiltonian systems. In particular, we explain why the monodromy around these singularities is non-trivial, a result obtained before by J.J. Duistermaat and others for some concrete systems.

2001-10-14abs ↗pdf ↗

DisCoPyro combines category theory with machine learning for program learning.

problem Applying category theory to machine learning tasks.
method Introducing DisCoPyro, a framework combining categorical structures with amortized variational inference.
result DisCoPyro can be applied in program learning for variational autoencoders and potentially contributes to AGI.

We concretely construct a 2-categorically extended TQFT that extends the Reshetikhin-Turaev TQFT to cobordisms with corners. The source category will be a well chosen 2-category of decorated cobordisms with corners and the target bicategory will be the Kapranov-Voevodsky 2-vector spaces.

2013-09-14abs ↗pdf ↗

We investigate the curvature properties of a two-parameter family of Hermitian structures on the product of two Sasakian manifolds, as well as intermediate relations. We give a necessary and sufficient condition for a Hermitian structure belonging to the family to be Einstein and provide concrete examples.

2011-10-06abs ↗pdf ↗

A "Chen space" is a set X equipped with a collection of "plots" - maps from convex sets to X - satisfying three simple axioms. While an individual Chen space can be much worse than a smooth manifold, the category of all Chen spaces is much better behaved than the category of smooth manifolds. For example, any subspace …

2008-07-10abs ↗pdf ↗

Framework improves GCNs for graphless and adversarial settings.

problem Improving GCNs without graph data and making them robust to adversarial attacks.
method Joint probabilistic model with variational inference and Concrete distributions.
result Framework outperforms state-of-the-art algorithms on semi-supervised classification.

We study parallel surfaces and dual surfaces of cuspidal edges. We give concrete forms of principal curvature and principal direction for cuspidal edges. Moreover, we define ridge points for cuspidal edges by using those. We clarify relations between singularities of parallel and dual surfaces and differential geometri…

2015-10-22abs ↗pdf ↗