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

Trend · papers per month

1.6%3.3%4.9%6.5% · Nov 201819922001200920172026
48 results for leisure activities

Tensor factorization uncovers hidden patterns in student behavior data.

problem Discovering low-dimensional structure in high-dimensional behavioral data.
method Non-negative tensor factorization applied to wearable sensor data.
result Tensor factorization reveals clusters of students with different behaviors.

Study examines how liquidity constraints impact optimal retirement decisions.

problem Impact of liquidity constraints on optimal retirement decisions.
method Analytical solution using duality method with different liquidity constraints.
result Sensitivity analysis reveals the effect of liquidity constraints on retirement decisions.

These notes are based on a lecture series given at the Park City Math Institute in the summer of 2013. The notes are intended as a leisurely introduction to the Kähler-Ricci flow on compact Kähler manifolds, aimed at graduate students with some background in differential geometry.

2015-02-24abs ↗pdf ↗

This article intends to provide an introduction to the construction of small exotic 4-manifolds. Some of the necessary background is covered. An exposition is given of J. Park's construction in arXiv:math.GT/0311395 of an exotic CP^2#7(-CP^2). This article does not intend to present any new results. It was originally a…

2008-12-10abs ↗pdf ↗

The paper refutes standard asset pricing models and introduces new theories.

problem Inaccuracies in standard asset pricing models.
method Introduces new theories and empirical tests to explain asset pricing anomalies.
result New theories explain why standard models are inaccurate and provide insights.

This paper gives a leisurely introduction to Calabi-Yau manifolds and special Lagrangian submanifolds from the differential geometric point of view, followed by a survey of recent results on singularities of special Lagrangian submanifolds, and their application to the SYZ Conjecture. It is aimed at graduate students i…

2001-08-13abs ↗pdf ↗

Optimal retirement timing and consumption under shortfall risk management

problem Optimal portfolio, consumption, and endogenous early retirement problem
method Maximizing expected lifetime consumption utility while managing the maximum wealth shortfall relative to a benchmark
result Geometric structure of the stopping set and feedback-form optimal retirement boundary

Study analyzes how discounts affect train ticket purchases and rescheduling in Switzerland.

problem Understanding how discounts influence train ticket buying and rescheduling behavior.
method Machine learning techniques, including causal machine learning, to analyze survey data.
result Increasing a discount rate by 1% increases the rescheduled trip share by 0.16% among always buyers.

Many activation functions have been proposed in the past, but selecting an adequate one requires trial and error. We propose a new methodology of designing activation functions within a neural network at each layer. We call this technique an "activation ensemble" because it allows the use of multiple activation functio…

2017-02-24abs ↗pdf ↗

This paper studies activation sparsity in large language models, finding key trends and implications.

problem Activation sparsity in large language models (LLMs) can be improved for efficiency and interpretability.
method Proposes PPL-p%p\% sparsity, analyzes trends with training data, width-depth ratio, and parameter scale.
result ReLU is more efficient for sparsity than SiLU, and deeper architectures can improve sparsity.

Many neural network architectures rely on the choice of the activation function for each hidden layer. Given the activation function, the neural network is trained over the bias and the weight parameters. The bias catches the center of the activation, and the weights capture the scale. Here we propose to train the netw…

2019-01-28abs ↗pdf ↗

BinaryDuo improves BNNs by coupling binary activations, outperforming state-of-the-art models.

problem Gradient mismatch in BNNs due to binarizing activations.
method Using gradient of smoothed loss function to estimate gradient mismatch, proposing BinaryDuo scheme with coupled ternary activations.
result BinaryDuo outperforms state-of-the-art BNNs on various benchmarks.

Evolutionary algorithms improve neural network performance by discovering better activation functions.

problem The choice of activation function affects neural network performance, but ReLU remains dominant.
method Defined a tree-based search space of candidate activation functions and used evolutionary algorithms (mutation, crossover, exhaustive search) to explore and discover better functions.
result Replacing ReLU with evolved activation functions statistically significantly increases network accuracy.

Collaborative filtering is a useful technique for exploiting the preference patterns of a group of users to predict the utility of items for the active user. In general, the performance of collaborative filtering depends on the number of rated examples given by the active user. The more the number of rated examples giv…

2012-07-11abs ↗pdf ↗

Bayesian adaptive designs can be biased by active learning, especially with misspecified models.

problem Active learning bias in Bayesian adaptive experimental designs.
method Analysis of linear and preference learning models, empirical testing.
result Model misspecification and noise influence active learning bias in Bayesian designs.

Study binary activated deep neural networks using PAC-Bayesian theory.

problem Generalization bounds for binary activated deep neural networks.
method Developed an end-to-end framework and provided PAC-Bayesian generalization bounds.
result Nonvacuous PAC-Bayesian generalization bounds for binary activated deep neural networks.

RAN model recognizes multiple activities from unlabeled sensor data.

problem Handling weakly labeled multi-activity data from wearable sensors.
method Recurrent Attention Networks (RAN) for sequential multi-activity recognition and localization.
result RAN model can infer multiple activities and determine activity locations from unlabeled data.

Active testing reduces label costs for efficient model evaluation.

problem Real-world applications require expensive test labels, disconnecting from existing model evaluation methods.
method Derives acquisition strategies to select test points efficiently, addressing label bias and variance.
result Active testing improves model evaluation efficiency without sacrificing accuracy.

Deep neural networks with various activation functions can approximate Hölder smooth functions.

problem Expressivity of deep neural networks with general activation functions.
method Investigates approximation ability of deep neural networks with a broad class of activation functions, including Hölder smooth functions.
result Derives the required depth, width, and sparsity of deep neural networks to approximate Hölder smooth functions.

Survey of trainable activation functions in neural networks.

problem Improving neural network performance through trainable activation functions.
method Taxonomy and comparison of recent and past models of trainable activation functions.
result Many trainable activation functions are equivalent to adding neuron layers with fixed activation functions and simple constraints.

This paper analyzes and improves active learning techniques for real-world projects.

problem Reducing labelling effort in machine learning models with real-world constraints.
method Systematic study of active learning issues, proposing techniques to address model convergence, annotation error, and dataset imbalance.
result Presentation of two techniques to speed up active learning: partial uncertainty sampling and larger query size.

Study active nematic forces on curved surfaces, revealing new coupling mechanisms.

problem Understanding active nematic forces on curved surfaces.
method Developed a thermodynamically consistent surface model with nematic activity, analyzed topological defects.
result Active defects contribute both tangential and normal forces on curved surfaces.

Bayesian active learning method improved for censored regression data.

problem Challenges in estimating BALD for censored regression data.
method Derived entropy and mutual information for censored distributions, developed C\mathcal{C}-BALD objective, proposed novel modelling approach.
result Demonstrated C\mathcal{C}-BALD outperforms other methods in censored regression.

Large deviation principle for deep neural networks with ReLU activation.

problem Understanding the behavior of deep neural networks with ReLU activation.
method Proving a large deviation principle for networks with Gaussian weights and ReLU activation functions.
result Simplified expressions and power-series expansions for the ReLU case.

EmbraceNet fusion model for multi-sensor activity recognition.

problem Human activity recognition using multiple sensors is challenging.
method Independent processing of each sensor, feature fusion with EmbraceNet, post-processing, and additional processes.
result Improved performance in SHL recognition challenge.

New proof shows neural networks can memorize training data with high accuracy.

problem Proving neural networks can memorize training data with high accuracy.
method Probabilistic construction exploiting sparsity.
result Proves neural networks with threshold or mixed threshold-ReLU activations can memorize training data.

We consider active learning of deep neural networks. Most active learning works in this context have focused on studying effective querying mechanisms and assumed that an appropriate network architecture is a priori known for the problem at hand. We challenge this assumption and propose a novel active strategy whereby …

2018-11-19abs ↗pdf ↗

Data-aware activation function customization reduces neural network error.

problem Current neural networks lack consideration for specific activation functions.
method Linear algebraic explanation and Diaconis-Shahshahani Approximation Theorem criteria for activation functions.
result Using an even activation function like seagull can reduce neural network error by orders of magnitude.

This paper explores adaptive neural activation in RNNs for better learning.

problem Fixed neural activation functions limit the performance and adaptability of RNNs.
method Developed a novel parametric family of nonlinear activation functions inspired by biological neurons.
result Adaptive neural activation improves learning speed and performance in RNNs.

DAL uses disentanglement for automatic labeling in GAN-based active learning.

problem Reducing human labeling in GAN-based active learning.
method DAL leverages disentanglement in InfoGAN to automatically label datapoints, deciding human labeling based on disagreement with InfoGAN labels and label correction.
result DAL achieves better performance than existing GAN-based active learning approaches on image classification tasks.