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

Trend · papers per month

55109164218 · Jun 202019922001200920172026
48 results for RES utility

Research optimizes a small RES utility's portfolio by dynamically trading in German electricity markets.

problem Managing risks in RES producers and electricity traders in changing electricity markets.
method Uses SVAR model to estimate market relationships and data-driven trading strategies to optimize revenue and reduce risk.
result Data-driven trading strategies increase utility revenue and reduce trading risk.

Sensitive inferences and user re-identification are major threats to privacy when raw sensor data from wearable or portable devices are shared with cloud-assisted applications. To mitigate these threats, we propose mechanisms to transform sensor data before sharing them with applications running on users' devices. Thes…

2019-11-14abs ↗pdf ↗

Machine learning models predict depression risk based on various factors.

problem Identifying individuals at greatest risk for depression.
method Random Effects/Expectation Maximization (RE-EM) trees and Mixed Effects Random Forest (MERF) algorithms.
result Machine learning models accurately predict depression severity and identify key predictors.

RES, a regularized stochastic version of the Broyden-Fletcher-Goldfarb-Shanno (BFGS) quasi-Newton method is proposed to solve convex optimization problems with stochastic objectives. The use of stochastic gradient descent algorithms is widespread, but the number of iterations required to approximate optimal arguments c…

2014-01-29abs ↗pdf ↗

Proposes CRG_IMSC for better clustering of multi-view data.

problem Lack of effective connectivity in clustering results.
method Directly obtains clustering result with nonnegative constraint; constructs connectivity matrix based on spectral clustering result; uses multiplicative update algorithm.
result Improves clustering performance on benchmark datasets.

Frequentist method estimates uncertainty in RNNs without altering architecture.

problem Uncertainty quantification in RNNs for decision-making.
method Jackknife resampling and influence functions to estimate variability.
result The method provides theoretical coverage guarantees on uncertainty intervals.

In frictionless markets, utility maximization problems are typically solved either by stochastic control or by martingale methods. Beginning with the seminal paper of Davis and Norman [Math. Oper. Res. 15 (1990) 676--713], stochastic control theory has also been used to solve various problems of this type in the presen…

2010-10-21abs ↗pdf ↗

Beta-SOD detects and corrects noisy object re-identification using cosine similarity and Beta mixtures.

problem Noisy object re-identification in image datasets.
method Reframed Re-ID as a similarity task, using Siamese networks and Beta mixture models.
result Superior performance in noisy conditions compared to state-of-the-art methods.

We compare the isoperimetric profiles of $S^2 \times \re^3$ and of $S^3 \times \re^2$ with that of a round 5-sphere (of appropriate radius). Then we use this comparison to obtain lower bounds for the Yamabe constants of $S^2 \times \re^3$ and $S^3 \times \re^2$. Explicitly we show that $Y(S^3 \times \re^2, [g_0^3 +dx^2…

2012-02-06abs ↗pdf ↗

Optimizes decision-making with uncertain variables using auxiliary observations.

problem Contextual stochastic optimization problems with uncertain variables and rich auxiliary observations.
method Trains forest decision policies by growing trees that optimize downstream decision quality, using optimization perturbation analysis for efficient approximations.
result Proves asymptotic optimality and empirical validation of the method's performance and efficiency.

SR-NAM maps low-res images to multiple high-res images realistically.

problem Mapping low-resolution images to multiple high-resolution images realistically.
method SR-NAM using Non-Adversarial Mapping (NAM) technique and a degradation model.
result Realistic degradation and down-sampling of high-resolution images.

We aim to construct a general framework for portfolio management in continuous time, encompassing both stocks and bonds. In these lecture notes we give an overview of the state of the art of optimal bond portfolios and we re-visit main results and mathematical constructions introduced in our previous publications (Ann.…

2005-10-16abs ↗pdf ↗

Re-initializing neural networks improves generalization but not as much as other techniques.

problem Understanding when and how re-initialization improves neural network performance.
method Empirical comparison of re-initialization with standard training and various regularization techniques.
result Re-initialization is beneficial for generalization but not as much as other techniques, especially when combined with careful tuning of hyperparameters.

Model predicts wound and episode-level readmission risk and time to re-admit.

problem Identify patients at high risk of re-admission to prevent wound recurrences and reduce healthcare costs.
method Data-driven analysis of wound care and episode-level patient data.
result Model achieves high recall and precision for predicting re-admission risk and time.

Person Re-identification (re-id) faces two major challenges: the lack of cross-view paired training data and learning discriminative identity-sensitive and view-invariant features in the presence of large pose variations. In this work, we address both problems by proposing a novel deep person image generation model for…

2017-12-06abs ↗pdf ↗

It is becoming increasingly clear that users should own and control their data. Utility providers are also becoming more interested in guaranteeing data privacy. As such, users and utility providers should collaborate in data privacy, a paradigm that has not yet been developed in the privacy research community. We intr…

2018-05-18abs ↗pdf ↗

S2OSC improves OSC by filtering and re-training models with out-of-class instances.

problem Difficulty in classifying out-of-class instances during inference.
method S2OSC combines semi-supervised learning, out-of-class instance filtering, and model re-training.
result S2OSC achieves state-of-the-art performance in various OSC tasks.

Whenever a social media user decides to share a story, she is typically pleased to receive likes, comments, shares, or, more generally, feedback from her followers. As a result, she may feel compelled to use the feedback she receives to (re-)estimate her followers' preferences and decides which stories to share next to…

2019-09-01abs ↗pdf ↗

Paper proves Reshetikhin-Turaev link invariants appear in higher order terms of re-normalized link invariants for plumbed links.

problem Proving relations between Reshetikhin-Turaev and re-normalized link invariants for links.
method Analyzing higher order terms of re-normalized link invariants for plumbed links.
result Reshetikhin-Turaev link invariants appear in higher order terms of re-normalized link invariants for plumbed links.

New framework boosts neural network performance and resilience.

problem Susceptibility of compact neural network implementations to system disturbances.
method Realistic crossbar simulations and Mosaics framework to re-use synaptic connections.
result Compact neural networks are noise-immune and perform well under disturbances.

It is natural to ask: what kinds of matrices satisfy the Restricted Eigenvalue (RE) condition? In this paper, we associate the RE condition (Bickel-Ritov-Tsybakov 09) with the complexity of a subset of the sphere in Rp\R^p, where pp is the dimensionality of the data, and show that a class of random matrices with indep…

2009-12-21abs ↗pdf ↗

Develops RES metrics for stable rare-event forecasting evaluation.

problem Challenges in evaluating forecasts of rare events.
method Rare-event-stable (RES) metrics designed to maintain stable thresholds under extreme rarity.
result RES metrics maintain stable thresholds, consistent model rankings, and near-complete prevalence invariance.

The paper analyzes how re-weighting helps in reducing variance in high-dimensional kernel methods under covariate shifts.

problem The challenge of high-dimensional kernel methods under covariate shifts and the role of re-weighting.
method Derives asymptotic expansion of high-dimensional kernels under covariate shifts, analyzes bias-variance decomposition, and characterizes the regularized kernel.
result Re-weighting helps in decreasing variance and can be seen as a data-dependent regularization.

Optimizes leveraged staking strategies in decentralized finance.

problem Maximizing returns on staked assets in decentralized lending platforms.
method Developed a mathematical framework to optimize leveraged staking strategies, reducing the multi-market problem to convex allocation over market exposures.
result Rebalanced leveraged positions can achieve up to 6.2% APY, significantly higher than unleveraged staking.

By the Fox's re-embedding theorem, any compact submanifold of the 3-sphere can be re-embedded in the 3-sphere so that it is unknotted. It is unknown whether the Fox's re-embedding can be replaced with twistings. In this paper, we will show that any closed 2-manifold embedded in the 3-sphere can be unknotted by twisting…

2016-09-21abs ↗pdf ↗

Examines climate financing for renewable energy projects using structured funds.

problem Valuation of structured climate financing on diverse renewable energy asset pools.
method Bottom-up Gaussian copula framework with LH++ model for diversification analysis.
result Shows how the mix of indirect and direct RE investments affects the sensitivity of the senior tranche.

RE enhances DL by learning model behavior, enabling iterative self-improvement.

problem Static data representations limit DL's potential for evolving models.
method RE uses multiple mappings of data through identical deep architectures, analyzing internal representations and performance signals.
result Models can gain insight from predecessors, leading to iterative self-improvement.

Researchers develop a framework for quantum machine learning models.

problem Comparing quantum machine learning models and their resource requirements.
method Constructive framework of linear quantum models using quantum information theory.
result Linear quantum models require exponentially more qubits than data re-uploading models for certain learning tasks.

New theory shows perishable goods markets are more stable and efficient.

problem Lower stability and efficiency of markets for re-tradable assets compared to perishable goods.
method Reformulation of no-trade and no-arbitrage theorems in neoclassical finance.
result Perishable goods markets exhibit higher stability and efficiency.

New algorithm maintains privacy while improving model performance in selective release.

problem Privacy degradation and slow convergence in DPSGD.
method Differentially Private Selective Release based on Clipped Gradients (DPSR-CG).
result Maintains strict privacy guarantees while achieving exceptional model performance.

We are interested in attribute-guided face generation: given a low-res face input image, an attribute vector that can be extracted from a high-res image (attribute image), our new method generates a high-res face image for the low-res input that satisfies the given attributes. To address this problem, we condition the …

2017-05-28abs ↗pdf ↗

New algorithm tackles dynamic assortment optimization with knapsack constraints.

problem Optimizing retailer's assortment decisions under resource constraints with multi-nomial choice modeling.
method Epoch-based re-solving algorithm that transforms MNL's fractional structure into a linear program with slack variables.
result Regret scales logarithmically with time horizon and resource capacities.

Deep learning algorithms can fare poorly when the training dataset suffers from heavy class-imbalance but the testing criterion requires good generalization on less frequent classes. We design two novel methods to improve performance in such scenarios. First, we propose a theoretically-principled label-distribution-awa…

2019-06-18abs ↗pdf ↗