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

14284256 · Jun 202019922001200920172026
48 results for abatement efforts

Study examines how market dynamics affect emissions trading prices and abatement efforts.

problem Effectiveness of emissions markets depends on regulatory standards, costs, and abatement levels.
method Radner equilibrium framework that considers intertemporal decision-making and uncertainty.
result Variations in regulatory standards, costs, and abatement levels influence allowance prices and abatement efforts.

Modeling climate change costs with stochastic interest rates shows inequality, but funding abatement can reduce this.

problem Evaluating the costs and benefits of climate change mitigation with uncertain discount rates.
method Amended DICE model with stochastic interest rates and funding abatement costs.
result Introducing funding abatement can reduce intergenerational inequality in climate change costs.

Model shows how discount rates affect intergenerational equity in climate mitigation.

problem Intergenerational equity in climate mitigation decisions.
method Extended DICE model with stochastic discount rates and financing extensions.
result Discount-rate uncertainty amplifies intergenerational inequality in climate mitigation.

Optimal dynamic allocation of carbon allowances reduces emissions efficiently.

problem Reducing carbon emissions from firms over time with dynamic allocation and trading.
method Variational approach to solve the Stackelberg game between regulator and firms.
result Optimal policies lead to constant abatement effort and allowance price, outperforming static allocations.

The study examines how climate risk influences sovereign debt default decisions.

problem The relationship between climate risk and sovereign debt default decisions.
method Calibration of a model to analyze the credit spreads of sovereign bonds and the impact of climate vulnerability on bond spreads.
result Climate risk does not significantly influence the decision to default on sovereign debt.

Defines an implied CO2-price to cover climate change costs, finding it significantly higher than the SCC.

problem The social cost of carbon (SCC) does not fully cover climate change costs.
method Defines an implied CO2-price as a 'polluter pays principle' and calculates its value using a DICE model.
result The cost-implied CO2 price is around 500/tCO2,comparedto50/tCO2, compared to 50/tCO2 for SCC.

Optimizes gradual reduction of excess carbon emissions to net-zero.

problem Achieving net-zero carbon emissions through gradual reduction of excess emissions.
method Stochastic control approach to identify optimal emission strategy under constraints.
result Identifies the emission strategy that maximizes future profit from excess emissions.

Using open source data, we observe the fascinating dynamics of nighttime light. Following a global economic regime shift, the planetary center of light can be seen moving eastwards at a pace of about 60 km per year. Introducing spatial light Gini coefficients, we find a universal pattern of human settlements across dif…

2013-03-12abs ↗pdf ↗

Unified framework for growth models with environmental risk and pollution-dependent disasters.

problem Analyzing how rare but catastrophic shocks interact with capital accumulation and pollution in stochastic growth models.
method General Poisson point process formulation leading to non-local HJB equations with closed-form solutions.
result Unified framework captures how environmental degradation amplifies macroeconomic vulnerability and strengthens incentives for abatement.

The paper proposes a method to measure fairness through equality of effort using algorithmic recourse.

problem Measuring fairness through equality of effort in automated systems.
method Applying algorithmic recourse to quantify equality of effort, overcoming previous limitations.
result An algorithm for assessing equality of effort has been developed and validated.

Accurate annotation of medical image is the crucial step for image AI clinical application. However, annotating medical image will incur a great deal of annotation effort and expense due to its high complexity and needing experienced doctors. To alleviate annotation cost, some active learning methods are proposed. But …

2019-01-06abs ↗pdf ↗

Investor and firm optimize sustainable investment and emission reduction through a dynamic game.

problem Optimal sustainable investment and emission reduction in a dynamic game setting.
method Formulated as a nonzero-sum dynamic game, solved via variational inequalities and verified in a diffusive setup.
result Nash equilibria show moving boundaries increasing with emission abatement, triggered by both investor and firm actions.

Replication study shows Deep-SE still not as effective as previously thought for agile effort estimation.

problem Improving accuracy in estimating agile software development effort.
method Close replication of Deep-SE using additional data and comparison with multiple baselines.
result Deep-SE outperforms only a few cases, suggesting more work is needed.

Adaptive Bernstein copulas improve risk management by preventing overfitting and reducing simulation effort.

problem Overfitting and high simulation effort in estimating dependence models.
method Constructive approach to Bernstein copulas with an admissible discrete skeleton.
result Comparison of different copula approaches in risk management shows improved accuracy and efficiency.

Algorithms are often used to produce decision-making rules that classify or evaluate individuals. When these individuals have incentives to be classified a certain way, they may behave strategically to influence their outcomes. We develop a model for how strategic agents can invest effort in order to change the outcome…

2018-07-13abs ↗pdf ↗

Optimal contracts are found for agents with quadratic effort costs.

problem Finding optimal contracts in principal-agent problems with quadratic effort costs.
method Modeling the problem using Hamilton-Jacobi-Bellman (HJB) equations and proving the existence of classical solutions.
result Existence of optimal contracts for agents with quadratic effort costs is proven.

Software development effort estimation is considered a fundamental task for software development life cycle as well as for managing project cost, time and quality. Therefore, accurate estimation is a substantial factor in projects success and reducing the risks. In recent years, software effort estimation has received …

2019-01-08abs ↗pdf ↗

We put together some of the efforts by several people of making aspects of fibre bundle theory into algebra. The initiator of these efforts was Charles Ehresmann, who put the notion of groupoid and groupoid action in the focus of fibre bundle theory in general, and in connection theory in particular.

2000-05-12abs ↗pdf ↗

This paper makes the first attempt to introduce the tools from computer graphics into the art pricing research. We argue that the creation of a painting calls for a combination of conceptual effort and painting effort from the artist. However, as the important price determinants, both efforts are long missing in the tr…

2019-10-09abs ↗pdf ↗

We study investment strategy in different models of financial markets, where the investors cannot reach a perfect knowledge about available assets. The investor spends a certain effort to get information; this allows him to better choose the investment strategy, and puts a selective pressure upon assets. The best strat…

1999-12-17abs ↗pdf ↗

The paper introduces new metrics on complex domains with specific geometric properties.

problem Developing metrics on complex domains with strong pseudoconvexity and holomorphic invariance.
method Explicit construction of holomorphic invariant strongly pseudoconvex complex Finsler metrics via deformation of Bergman metrics.
result These metrics have bounded curvature properties similar to Bergman metrics.

Optimal linear contracts are possible even with memory in Gaussian settings.

problem Can optimal dynamic contracts be linear when agents control memory processes?
method Developed a methodology for non-Markovian and non-semimartingale settings, showed linear contracts are optimal for one-dimensional models.
result Linear contracts are optimal for one-dimensional models with memory, and for radial effort cost functions in higher dimensions.

Uncertainty computation in deep learning is essential to design robust and reliable systems. Variational inference (VI) is a promising approach for such computation, but requires more effort to implement and execute compared to maximum-likelihood methods. In this paper, we propose new natural-gradient algorithms to red…

2018-06-13abs ↗pdf ↗

Many leading classification algorithms output a classifier that is a weighted average of kernel evaluations. Optimizing these weights is a nontrivial problem that still attracts much research effort. Furthermore, explaining these methods to the uninitiated is a difficult task. Letting all the weights be equal leads to …

2015-06-04abs ↗pdf ↗

Bayesian optimization reduces computational effort in aircraft design optimization.

problem High computational cost in industrial aircraft design optimization.
method Constrained Bayesian optimization (Super Efficient Global Optimization with Mixture of Experts)
result Significant computational efficiency improvements over existing Isight optimizers.

Although there has been substantial research in software analytics for effort estimation in traditional software projects, little work has been done for estimation in agile projects, especially estimating user stories or issues. Story points are the most common unit of measure used for estimating the effort involved in…

2016-09-02abs ↗pdf ↗

The majority of data scientists and machine learning practitioners use relational data in their work [State of ML and Data Science 2017, Kaggle, Inc.]. But training machine learning models on data stored in relational databases requires significant data extraction and feature engineering efforts. These efforts are not …

2020-02-06abs ↗pdf ↗

Drug-Drug Interactions (DDIs) Extraction refers to the efforts to generate hand-made or automatic tools to extract embedded information from text and literature in the biomedical domain. Because of restrictions in hand-made efforts and their lower speed, Machine-Learning, or Deep-Learning approaches have become more po…

2019-07-31abs ↗pdf ↗

The calculation of minimum energy paths for transitions such as atomic and/or spin re-arrangements is an important task in many contexts and can often be used to determine the mechanism and rate of transitions. An important challenge is to reduce the computational effort in such calculations, especially when ab initio …

2017-03-30abs ↗pdf ↗

Recent research has shown that although Reinforcement Learning (RL) can benefit from expert demonstration, it usually takes considerable efforts to obtain enough demonstration. The efforts prevent training decent RL agents with expert demonstration in practice. In this work, we propose Active Reinforcement Learning wit…

2018-12-06abs ↗pdf ↗

PANDA improves linear discriminant analysis in high dimensions with minimal tuning.

problem Linear discriminant analysis in high-dimensional settings.
method PANDA: a tuning-insensitive method for linear discriminant analysis.
result PANDA achieves optimal convergence rates in estimation error and misclassification rate.

Consequential decision-making typically incentivizes individuals to behave strategically, tailoring their behavior to the specifics of the decision rule. A long line of work has therefore sought to counteract strategic behavior by designing more conservative decision boundaries in an effort to increase robustness to th…

2018-08-25abs ↗pdf ↗

We design an active learning algorithm for cost-sensitive multiclass classification: problems where different errors have different costs. Our algorithm, COAL, makes predictions by regressing to each label's cost and predicting the smallest. On a new example, it uses a set of regressors that perform well on past data t…

2017-03-03abs ↗pdf ↗